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 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | atcoder_official | 148 |
| 5 | -is-this-fft- | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 10 | TheScrasse | 142 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 27.07.2024 14:53:40 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.
thanks for this problem
yupp! If you know about difference array then it's super easy
733C
One of the best greedy problems
Even the test cases were also visible and understandable. Thanks for the recommendation.
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 - Divisor Chain
780B - The Meeting Place Cannot Be Changed
Cool technique which will teach you how to deal with segments using binary search.