#  User  Rating 

1  tourist  3757 
2  jiangly  3647 
3  Benq  3581 
4  orzdevinwang  3570 
5  Geothermal  3569 
5  cnnfls_csy  3569 
7  Radewoosh  3509 
8  ecnerwala  3486 
9  jqdai0815  3474 
10  gyh20  3447 
#  User  Contrib. 

1  maomao90  171 
2  awoo  164 
2  adamant  164 
4  TheScrasse  159 
5  nor  154 
5  maroonrk  154 
7  isthisfft  152 
8  Petr  147 
9  orz  146 
10  pajenegod  145 
+4
I'm not asking about solution, I'm asking about pretest. 
+3
Can someone explain what the hell is going on with pretest 1 to div1B, div2D? 
+3
Should be  instead &&. 
0
Can anyone explain solution to E with ordered statistics set? I saw few codes that get AC but I don't understand them all. And what does this magic loop:

0
Graph doesn't have to be connected. Here is example: n = 3 * 10^5, m = 0 Then this part: Spoiler
will take n^2 time. Another bug in your code is in this line:
black and red can be bigger than 64. Better option is to just count every 2^k % MOD at the start of your program:

+3
In problem E you have to divide both permutations to blocks of length sqrt(n) and than make some calculations. 
0
Graph doesn't have to be connected. 
0
Can someone give me some links where I can learn about convex hull opt? The old ones that are on codeforces blog's does not work. 
+4
I don't really understand why problems like C appears in contest like this. I could understand it, if contest would have 5h. But excluding this task contest was really good prepared and there wasn't dos attack during the contest ;) 
+4
And computers become faster and faster nowadays. It's not like 10^6 operations will take 1 second... 
+43
Yes, that was nice. This contest was really well written. All tasks have pretty good and short solutions. Thanks to Ashishgup for that contest. 
0
I have the same idea, but haven't enough time to debug. This solution should be good. You have at lest 1/4 chance to find this leafs if you take two random vertices. 
+4
OK, it's small probability. But if he has more than 50 accounts? Mabye there is a person who starts in contests to have a high rating... 
+6
Maybe someone is cheating and has two accounts: at one he sends wrong solutions, and from another he hacks... 
+18
Thanks Kniaz for writing problems. I like tasks A, B, E, F very much, D is OK, but problem C is terrible. I hate this type. A lot of commands 'if', 'else'. But it's only my liking. So excluding problem C contest was pretty good. 
Name 
