Блог пользователя aryansingh22070

I want to reach 1200 from 750. How should I practice, what topics do I need to cover.
Автор aryansingh22070, история, 11 месяцев назад, По-английски

My current rating is ~750

My goal is to reach 1200 by the end of Jan/Feb, I don't know how I should practice on CF and what topics I need to study and practice to reach 1200.

I'm not looking for any shortcuts, I want to grow steadily while having good foundations in CP. I want to know the resources/practice-problems/approaches that helped you to reach 1200 from a total beginner.

Thanks a lot.

  • Проголосовать: нравится
  • -4
  • Проголосовать: не нравится

»
11 месяцев назад, # |
← Rev. 2   Проголосовать: нравится +22 Проголосовать: не нравится

You did 8 contests. How would you even know that your rating is fluctuating?

Your profile lists only 60 solved problems. That's how many exercises the average student solves the week before a midterm exam in university. Just solve more problems. It doesn't even matter what they are as long as you can solve them in a few hours or less. (If this seems impossible, solve easier problems and retry the harder ones in a few weeks)

→ Ответить
  • »
    »
    11 месяцев назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    I would definitely practise and attend more contests more from now on, thanks. Sorry if this post came across as ill-informed.

    → Ответить
»
11 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Nothing special is required at this level....Just train your mind by solving 800-1000 rated problems as much as you can...Once you are comfortable with this then plan for learning something new....Like binary search, basic DP, sieve, dfs, bfs, etc.

All the best for your journey !

→ Ответить
  • »
    »
    11 месяцев назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Thanks bro, I saw your profile, you have worked really hard. You have my respect and admiration. I look up to you. Wishing you the best.

    → Ответить
»
11 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Learn binary search once you think you have command over prefix sum, suffix sum, two pointer, sliding window, etc. Binary search not only includes low and high variable, it also includes STL methods like lower bound and upper bound. You should be proficient to use this whenever needed. All the best. Stay consistent. Give virtual contests of Div3.

→ Ответить
»
11 месяцев назад, # |
← Rev. 2   Проголосовать: нравится +2 Проголосовать: не нравится

I became specialist soon after reading these three blogs. Maybe it will work for you as well.

  1. https://mirror.codeforces.com/blog/entry/119082
  2. https://mirror.codeforces.com/blog/entry/76447
  3. https://mirror.codeforces.com/blog/entry/103979
→ Ответить
»
11 месяцев назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

pupil is piece of cake i did in 3 months i had no prior cp knowledge i practiced a bit but what helped me is doing so many contests

→ Ответить