Codeforces and Polygon may be unavailable from March 27, 11:00 (UTC) to March 27, 14:00 (UTC) due to technical maintenance.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3892 |
| 2 | jiangly | 3797 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3588 |
| 6 | ecnerwala | 3557 |
| 7 | Ormlis | 3532 |
| 8 | Benq | 3468 |
| 9 | Radewoosh | 3463 |
| 10 | Um_nik | 3450 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | Qingyu | 159 |
| 2 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 5 | Dominater069 | 156 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 150 |
| 9 | awoo | 148 |
| 10 | maomao90 | 145 |
→ Find user
→ Recent actions
Tutorial of Codeforces Round 958 (Div. 2)
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Mar/26/2025 22:48:56 (i1).
Desktop version, switch to mobile version.
Supported by
in D, why does it take at most lg(n) steps?