| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
+1
Problem D writing a perfect code, to getting RE on test 19 Reason: I wrote an assert statement to debug the TLE cause in the local machine Locking the problem and realizing I can't change this |
|
0
-ve delta teaches more than +ve if you want to grow. |
|
0
giving a CF rated contest after almost 3 months . lets relive those days again |
|
+1
exactly the same thing I was trying, would have got AC only if I didn't give up so early :(, |
|
+3
where can i submit code for Frank Sinatra — Problem F ? |
|
0
Dsu works when only addition of edges is there ,but how to handle removal of edges? |
|
0
This is a very good and easy solution , how can we extend this to a graph instead of a tree ? |
|
0
yes even my code outputs it as 1 and is AC |
|
-24
1st in our hub Motilal Ke coders(MNNIT) //thats also ranked 31 out of 490 total worldwide 142 in India ,944 Globally Team- is_it_rated Rook_Lift ,Electron ,Invincible06,Anurock007
It was a fantastic experience waking up till 4am and improvising the PS....thanks Hashcode |
| Name |
|---|


