There are lots of problems on Codeforces — and most of them will never be seen by most users of the site.
Share a problem you think more people should know about!
(It can be because it's fun, educational, interesting or any other reason.)
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 07.05.2026 15:10:09 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
276C
It uses a simple and really cool technique known as "+1 -1 trick". Do read the editorial to understand how to use it and how it works.
733C
One of the best greedy problems
P1, P2, P3, P4
706E - Working routine
Can be solved using linked list like 2D structure.
What I love about this is that it can only be solved for a 2D matrix, and not if it was an array of size $$$10^5$$$.
So in a sense, there is no easy 1D variant of the problem.
441E — Valera and Number
429C — Guess the Tree
755G — PolandBall and Many Other Balls
86D
Mo's Algorithm, basic problem
321E
Divide & Conquer DP optimization, basic problem
617E
Mo's Algorithm, medium problem
Dont post the hints openly that will spoil the party
Ah, OK
UPD Edited.
http://mirror.codeforces.com/contest/705/problem/C
Use a queue
484D - Kindergarten
Because I love this submission:
8757420
903D - Almost Difference
1864C - Цепочка делителей