Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

Hyperix's blog

I need good problems
By Hyperix, history, 8 months ago, In English

i learned graph algoritms and dp. but i can`t find good problems around my rating please help me

  • Vote: I like it
  • +10
  • Vote: I do not like it

»
8 months ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

you can solve graph problems there: https://codeforces.me/group/ibNhxWfOek/contests

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

that's because graph and dp problems don't really occur at this level. try solving standard problems in the graph and dp sections on https://cses.fi

→ Reply
  • »
    »
    8 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    thank you i will solve them. what about educational dp contest on atcoder?

    → Reply
    • »
      »
      »
      8 months ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      that's good too.

      you don't have to limit yourself to one site. if you see a place with good standard problems you could solve them if you wanted

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

I prefer CSES problemset and their book

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

graph problems with dfs/bfs don't come at your level, For DP, just filter tags put dp and solve easy problems and progress your way up :)

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

If there aren't many graph or DP problems around your rating, that means you probably don't need to be training them yet.

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

2012-2013 Тренировка СПбГУ С #5. Динамическое программирование. has a nice list of dp problems, I practiced these to get a feel on some basic dp.

I also have a personal favourite graph problem: 105873I - ICPC Challenge, which requires a small key observation before trying any graph algorithms.

→ Reply