Some constructive problems just feel like they are the perfect examples of Gödel's incompleteness theorem. i.e. They are corect (they pass all tests), yet there is no way to prove that they are actually correct.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 165 |
| 3 | Um_nik | 160 |
| 4 | atcoder_official | 159 |
| 4 | Dominater069 | 159 |
| 6 | djm03178 | 157 |
| 7 | adamant | 153 |
| 8 | luogu_official | 150 |
| 8 | awoo | 150 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
The-Winner | 2025-01-26 17:28:44 | 0 | (published) | |
| en2 |
|
The-Winner | 2025-01-26 17:28:16 | 5 | Tiny change: ' theorem. They are' -> ' theorem. i.e. They are' | |
| en1 |
|
The-Winner | 2025-01-26 17:27:33 | 234 | Initial revision (saved to drafts) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/27/2025 15:46:35 (h1).
Desktop version, switch to mobile version.
Supported by
