| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | nik_exists | 138 |
| 6 | adamant | 136 |
| 7 | maroonrk | 134 |
| 8 | DNR | 133 |
| 9 | Dominater069 | 131 |
| 9 | AmShZ | 131 |
|
You can try (some problems require something like dp[n][2] or dp[n][4]) https://codeforces.me/contest/180/problem/C https://codeforces.me/contest/234/problem/C https://codeforces.me/contest/1420/problem/C1 https://codeforces.me/contest/1526/problem/C1 https://codeforces.me/contest/166/problem/E https://codeforces.me/contest/545/problem/C https://codeforces.me/contest/1272/problem/D https://codeforces.me/contest/1061/problem/C Or just dp-tagged problems with difficulty from 1200 to 1500 |
|
0
thanks for the rating, i laughed a lot))) |
| Name |
|---|


