OrionJaman's blog

By OrionJaman, history, 11 days ago, In English

Hi! I am new in programming.I have started solving problems since November 2023 with my full effort.I have recently learned STL and binary search..Now trying to learn dynamic programming.I have solved some basic problems like coin change problems.But when I read new dp or binary search problem on codeforces ,I can not make the sense of implementing dp or binary search on that definite problem...any suggestion will be eagerly accepted.

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

»
11 days ago, # |
  Vote: I like it 0 Vote: I do not like it

same problem) I think we need practice more

  • »
    »
    11 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    how to make it efficiently?

    • »
      »
      »
      11 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      probably try to solve the problem (1200-1400) within 1 hour, and if you don't solve it, look at the editorial.