Codeforces Round #776 (Div. 3) Editorial
source link: http://codeforces.com/blog/entry/100712
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
63 minutes ago, # |
Thank you codeforces for this contest! I want more Div:3 contests as it boosts confidence for beginners like me
Recommend
-
29
Upd: fixed author's solution links.Sorry for the slow Editorial, I am new using Polygon.Special thanks to TechNite for his help.About one hour before...
-
19
Bidhan's blog
-
17
I'm sorry for a delay with publishing the editorial. 733A - Grasshopper And the StringIn this problem you have to find the longest sequence of...
-
24
editorials_late_again's blog
-
24
Codeforces Round #726 (Div.2) Editorial ssense's blog
-
19
350A - TLLet's v = min(ai), p = max(ai), c = min(bi). So, if max(2 * v, ...
-
18
okwedook's blog
-
18
4qqqq's blog ...
-
39
1625A - Ancient CivilizationNote that the problem can be solved independently for each bit, as the bits don't influence each other. Set the iith bit to ze...
-
18
Maksim1744's blog
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK