.
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
Auto comment: topic has been updated by is-this-ufds (previous revision, new revision, compare).
It really depends on what level you're coding at now.
I would suggest using the dp tags as a guide, but beware that many problems are tagged dp when dp is either not necessary or not relevant.
Here are a few I have tried myself recently: https://codeforces.me/problemset/problem/455/A https://codeforces.me/problemset/problem/1418/C https://codeforces.me/problemset/problem/1398/D https://codeforces.me/problemset/problem/1385/D (I solved using recursion, which is the same idea as DP) https://codeforces.me/problemset/problem/1253/C https://codeforces.me/problemset/problem/706/C https://codeforces.me/problemset/problem/545/C
These are all in the range 1500-1800. Obviously harder problems exist, but given my rating this is about where I'm operating so I can't recommend much beyond this range.
thanks a lot!!
https://atcoder.jp/contests/dp
https://atcoder.jp/contests/dp