839.md (1163B)
1 Source: https://codeforces.com/blog/entry/53815 2 3 Hi! 4 5 # Hints 6 7 **A**: Tag: Greedy! 8 9 **B**: Tag: Greedy! 10 11 **C**: For each vertex like *v* find *ex**v*, the expected length of their journey if they start from *v*. 12 13 **D**: Tag: Inclusion exclusion. 14 15 **E**: Find the maximum clique. 16 17 # Solutions 18 19 Tutorial is loading... 20 21 [Arpa](/profile/Arpa "Candidate Master Arpa")'s solution: [29412123](/contest/839/submission/29412123 "Submission 29412123 by Arpa"). 22 23 Tutorial is loading... 24 25 [Arpa](/profile/Arpa "Candidate Master Arpa")'s solution: [29412154](/contest/839/submission/29412154 "Submission 29412154 by Arpa"). 26 27 Tutorial is loading... 28 29 [Arpa](/profile/Arpa "Candidate Master Arpa")'s solution: [29412220](/contest/839/submission/29412220 "Submission 29412220 by Arpa"). 30 31 Tutorial is loading... 32 33 [NikaraBika](/profile/NikaraBika "Candidate Master NikaraBika")'s solution: [29458745](/contest/839/submission/29458745 "Submission 29458745 by NikaraBika"). 34 35 Tutorial is loading... 36 37 [Arpa](/profile/Arpa "Candidate Master Arpa")'s solution: [29412249](/contest/839/submission/29412249 "Submission 29412249 by Arpa"). 38 39 **P.S.** Please notify me if there is any problem.