DevCoder07's blog

How and what should I learn to solve Div.2 B problems consistently ?

By DevCoder07, history, 2 years ago, In English

I have recently got into cp and solved a few problems and I find that I can consistently solve Div.2 A problems quite easily. It is actually the B problems that make me think. Although I am usually able to solve them, it generally takes a LOT of time and thinking. So I want to know how and what should I practice and learn to solve the B problems consistently ? Thanks in advance.

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

Comments Comments (5)
| Write comment?
»
2 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

If you want to solve B problems faster and more frequently — practice B problems. You can do that by simply going to contest section and solve B problems from past events. Generally B-level problems don't require some special knowledge so it's more about getting an observation and implementing solution.

→ Reply
»
2 years ago, # |
← Rev. 2   Vote: I like it +2 Vote: I do not like it

two pointer, bit manipulation, hash map, binary search, sorting ,greedy. all this is common sense ,it doesn't require much theory ,you should mainly focus on practicing.

→ Reply
  • »
    »
    2 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    I have never used hash map in my life till now ) And I'm Candidate Master lol. The others things you told are neccessary for beginners, agree with you.

    → Reply