→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | nik_exists | 137 |
| 6 | adamant | 136 |
| 7 | maroonrk | 134 |
| 8 | DNR | 133 |
| 9 | Dominater069 | 131 |
| 9 | AmShZ | 131 |
→ Find user
→ Recent actions
Comments
|
0
How problem 2 can be solved by the Extended Lichao Tree? |
|
0
Why can't I use persistent segment tree to solve H? I know a persistent segment tree only costs O(nlogn) memory totally,but it seems to match the condition of 192 MB. |
|
0
How can we solve problem E in the complexity $$$O(n \log n)$$$ ? |
|
0
the importance of learning programming |
|
+12
Maybe soon |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/04/2026 19:53:57 (g2).
Desktop version, switch to mobile version.
Supported by
