is-this-ufds's blog

..
By is-this-ufds, history, 6 years ago, In English

.

  • Vote: I like it
  • -13
  • Vote: I do not like it

Comments Comments (5)
| Write comment?
»
6 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Auto comment: topic has been updated by is-this-ufds (previous revision, new revision, compare).

→ Reply
»
6 years ago, hide # |
 
Vote: I like it +4 Vote: I do not like it

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.

→ Reply
»
6 years ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

https://atcoder.jp/contests/dp

→ Reply
»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

https://atcoder.jp/contests/dp

→ Reply