→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
→ Find user
→ Recent actions
Comments
|
0
So there are 7 codeforces problems and an atcoder problem? |
|
On
E869120 →
[Tutorial] A Way to Practice Competitive Programming : From rating 1000 to 2000, 6 years ago
-8
$$$I$$$ $$$don't$$$ $$$know$$$ $$$how$$$ $$$to$$$ $$$do$$$ |
|
0
but the time complexity for problem D is $$$O(n^2 log n)$$$:( |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/08/2026 05:09:03 (g2).
Desktop version, switch to mobile version.
Supported by
