#  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  155 
6  maroonrk  154 
7  isthisfft  152 
8  Petr  147 
9  orz  146 
10  pajenegod  145 
0
Bug in my solution of D? Iterate over all points, if the answer for this point is yet to found then call function rec(Pi) from this point. Description of rec(Pi) function: Case 1: if Pi has any adjacent cell which is not in the input, set it as the answer for Pi and return. Case 2: if all adjacent cells of Pi is present in the input, call rec function for the adjacent cells if there answers are yet to found. And then choose answer for Pi among the 4 adjacent cells answers(choose the one with shortest Manhattan distance). code: here 
0
In problem H, submitting even the editorial implementation gives TLE on test case 5.[Not even using "\n" instead of endl]. 
+1
Hoping to see concise statements again and Ehab's XOR won't be missed this time ig 
0
Same. I just got 6 TLE with correct algorithm just for that and lost the points for C. 
+4

0
There is another nice approach to Problem D using combinatorics. 
0
steinum 
+3
Yes...But there is modular arithmetic.. 
+1
Problem C was really awesome and the statements were also quite perfect... 
0
If the string size 2e5 having all 1 in the string, then 
+6
Look after the first modulo operation x will be between So we have to calculate the mod of first operation. Now the problem is X is huge. X can be written as
This way we can handle the first operation. Another special case is cnt = 1, Then if S[pos] = 1, output will 0. Here is my Code 
+2
You don't had to ig... Brute force would suffice.. 
+1
Thanks man. That means 1e18 format is double type. 
+5
In B: 
0
Can we get all the elements of the maximum subarray by kadane's algorithm?? 
Name 
