i learned graph algoritms and dp. but i can`t find good problems around my rating please help me
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 132 |
| 10 | cry | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 08.11.2026 07:30:28 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
you can solve graph problems there: https://codeforces.me/group/ibNhxWfOek/contests
thank you
that's because graph and dp problems don't really occur at this level. try solving standard problems in the graph and dp sections on https://cses.fi
thank you i will solve them. what about educational dp contest on atcoder?
that's good too.
you don't have to limit yourself to one site. if you see a place with good standard problems you could solve them if you wanted
I prefer CSES problemset and their book
i live cses problems too. they are very interesting
graph problems with dfs/bfs don't come at your level, For DP, just filter tags put dp and solve easy problems and progress your way up :)
thank you
yw :D
If there aren't many graph or DP problems around your rating, that means you probably don't need to be training them yet.
i`ve solved many implementation problems
2012-2013 Тренировка СПбГУ С #5. Динамическое программирование. has a nice list of dp problems, I practiced these to get a feel on some basic dp.
I also have a personal favourite graph problem: 105873I - ICPC Challenge, which requires a small key observation before trying any graph algorithms.
thank you