I'm learning dynamic Programming (DP). I have already learned 0-1 Knapsack, Coin Change and LIS. I want to solve some problems on these categories. Please suggest me some problems of codeforces those are solvable by these 3 algorithms.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | jiangly | 3578 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | tourist | 3565 |
| 8 | maroonrk | 3531 |
| 9 | Radewoosh | 3521 |
| 10 | Um_nik | 3482 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 28.04.2024 14:58:02 (l3).
Десктопная версия, переключиться на мобильную.
При поддержке
If you just want to solve Codeforces problems then go through this [ btw if there is no tag for unsolve problems then click show tag for unsolve problems just below your profile info ] And for find out problems of any category you can check this
Good Luck :)
A2 Online Judge contains different categories of problem, although not all the problems are on Codeforces (mostly on SPOJ and UVa):
0/1 Knapsack : here
Coin Change : here
LIS : here
The problems are sorted by their difficulties which are shown on the rightmost column, so you may want to solve the problems from the easiest one.
Hope this can help you :)
Thank you. I think it will be helpful for me.
In this judge online you can find several problems about dp, http://coj.uci.cu/24h/problems.xhtml, plus you can categorize