→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Comments
|
-18
How did u solve B?? It looked ample hard to me... U rock dude :)
|
|
+3
time limit for C seems to be strict.... I used C++ STL and it got TLE :(
|
|
0
Somebody hacked mine.. and so i noticed the n = 2 case :D
|
|
0
I get that but where were we supposed to vote?
|
|
0
Where were we supposed to vote?? I had no idea and no one give any link where the voting was taking place... Can someone tell me how this voting thing goes about?
|
|
0
I got this error : Idleness limit exceeded on test 1, what does that mean? This was for problem A (round 36)
|
|
+2
What's test 2 in problem C? And the answer?
|
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/18/2026 23:19:21 (g1).
Desktop version, switch to mobile version.
Supported by
