.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 03:31:59 (j3).
Desktop version, switch to mobile version.
Supported by
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://mirror.codeforces.com/problemset/problem/455/A https://mirror.codeforces.com/problemset/problem/1418/C https://mirror.codeforces.com/problemset/problem/1398/D https://mirror.codeforces.com/problemset/problem/1385/D (I solved using recursion, which is the same idea as DP) https://mirror.codeforces.com/problemset/problem/1253/C https://mirror.codeforces.com/problemset/problem/706/C https://mirror.codeforces.com/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