In the recent Div 3 contest, all the problem G solutions are shown hacked (even tourist and geo). Is this some bug or what? Check the standings.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 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 | 133 |
| 10 | cry | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 08.11.2026 19:34:53 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
This comment has been deleted.
Most likely due to the test validator not being correct. The test that was used to hack shouldn't exist. If you look at the generator and the test that hacked tourist or other people, there are 999 test cases and in every test case n = 100, m = 100. But this isn't possible because it was guaranteed that sum of n * m over every test case <= 200000.
They are bad coders, what can I say?