NeverSayNever's blog

How to keep myself consistent at solving Div2 D or Div1 B ?
By NeverSayNever, 9 years ago, In English

Hello cool coders out here ..

Round Div1 299 was the first round when i am able to solve problem B during the contest itself and i feel very motivated after this. I want to be consistent at solving B during contest like i am on solving A. So, Suggest me something to keep myself consistent. I am eagerly waiting to read your valuable comments :). I was not much focussed during the last contest but still i solved two problems (it was really an amazing experience for me) or may be problem A and B were easy.

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

»
9 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Although i'm not div 1 right now, but to solve lots of D's in contest you should solve D's outside contest i think. This is a hundred Div2 D/Div1 B problems sorted ascending from easy to hard, I think it may help you.

→ Reply
  • »
    »
    9 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    @Tensor Thank you for your reply

    I have already started that ladder right from Div2 — A. (100 solved) currently Div 2-B (around 30 solved).

    What are the frequently repeated concepts / topics / data structure require to solve problem Div1 — B ?

    → Reply
    • »
      »
      »
      9 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      i know i will learn that by solving more and more Div1 — D problem out side the contest. but experience programmer can help me in better manner.

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

        I'm not sure if solving many Div 1 B's will help. Anyways, from my experience, I usually see z-algorithm, Segment tree, binary search, some graph algos, different sorts of DP, sqrt-decomposition and DSU. I'm pretty sure that if you know these good then you'll solve div1 B pretty easily. As for me, I found it easier to improve my algorithm knowledge rather than solving many problems. Though if you practice much you'll adapt and will understand which algo you need to use in the problem you're facing.

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

      I think many data structures and algorithms may be found in Div1 — B for example : BIT, segment tree, two pointers, implementation, graph algorithms, dp, strings math, binary search ... etc Even simple techinques and data structures maybe found in Div1-B so I think it's all about practicing.

      → Reply
      • »
        »
        »
        »
        9 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Thank u so much for your suggestions. I will definately work upon that part and will put efforts to solve Div1 — B everytime :) .

        → Reply