I said all in title :)
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 24.09.2026 04:04:00 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
cool prob
very nice problem! none of the individual observations were too hard, so it was good for a not particularly skilled person like myself with ample thinking time :p
abc346f
ABC395D probably, because the 3 mappings it constructed is quite subtle and requires more logical reasoning than an average 350-point problem.
probably this one, because i solved it with hashing, and that's pretty cool
ARC110E,AGC021E,ARC156F and AGC059F. They are absolutely beautiful problems.
wtf
This: ABC405_F
By the way, there were some cool problems where solution used maximum flow optimizations and was linear or n log n at the end but I lost these problems. Does someone remember them?