→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
Comments
|
+21
No worries. Anything can happen. As I'm a tourist fan, I believe that tourist will beat No.1 next time. |
|
+8
How to solve C? |
|
0
I don't know Russian but is it okay to participate and use google translation? Anybody doing it? |
|
+5
This is my first contest on this platform and it's really great. For G2, Editorial solves in O(nlogn) after sort but I solve in O(n) + O(logn) after sort. |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/18/2026 04:25:36 (n2).
Desktop version, switch to mobile version.
Supported by
