E869120's blog

[Tutorial] A way to Practice Competitive Programming : From Rating 1000 to 2400+
By E869120, 4 years ago, In English

Dear Codeforces community.
Finally red :)

Today, I want to share about some ways to practice competitive and gain your rating. I hope that this is helpful for those who is practicing competitive programming harder but rating is sluggish. There are 54,000+ people who participated in Codeforces contests actively, but sadly only a few people reach a red-ranked coders. For people who can't reach red, I will introduce my way to gain rating in some steps.

This blog is an extended and more detailed version of my previous tutorial blog, but 2 years and now are different. So there are many points that are different from blog which has written 2 years ago. Note: Some people who already read my previous tutorial blog may doubt, but do not doubt — I should say that the "from rating 1000 to 2000" part of this blog is not the copy of my previous blog and it's very different.

Since the size is very big, if I wrote contents to Codeforces blog directly, it might be too long. So, this time, I will share a 19-page PDF link of my tutorial blog. This time, my blog includes introduction, knowledge of some contests systems (AtCoder, TopCoder) and some convenient websites, some ways to practice for improve rating, and conclusion. Also, optimal practice method is differ by rating. So, this time, I will write in 4 steps: 1000 -> 1400, 1400 -> 1900, 1900 -> 2200, and 2200 -> 2400.


The link of my blog (PDF) is as follows:

[Tutorial] A way to practice competitive programming — from rating 1000 to 2400+


Please comment if you have suggestions, comments to my blog, and opinions on my way to practice.
Thank you for reading!
 
 
 
 
  • Vote: I like it
  • +607
  • Vote: I do not like it

Comments Comments (90)
| Write comment?
»
4 years ago, # |
← Rev. 2   Vote: I like it +20 Vote: I do not like it

Thank you !

→ Reply
»
4 years ago, # |
  Vote: I like it +16 Vote: I do not like it

Thank You for the amazing tutorial!. I hope you become LGM soon.

→ Reply
»
4 years ago, # |
  Vote: I like it +26 Vote: I do not like it

Could you please, write a tutorial about preparation for Olympiads in Informatics?

I appreciate your dedication and all this work very much, thank you for a new amazing tutorial!

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

    If you reach yellow+ in CF and/or topcoder. Plus you solve enough past OI problems from the well-known checklist by ko_osaga, I guess you're pretty much set to win atleast a bronze.

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

      E869120 has already won a gold medal at the IOI, link.

      For my country whole history only 2 students won a gold medal and it was 12 years ago. This fact confuses me, I don't think that we don't have talented hard-working students.

      Thus, I'm very curious about how to win a gold medal and it's a reason why I ask E869120 for help.

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

        Okay, now I know that there are a lot of people who wants to know how to get gold medal in IOI.

        Since writing so many blogs in short period is not so good for me, I'll write a blog about "[Tutorial] How to win a gold medal in IOI" (title is tenative) 2-3 weeks later.

        Thank you for your proposal. :)

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

      What is that well-knwn checklist? Can you please give me a list?

      → Reply
»
4 years ago, # |
  Vote: I like it +39 Vote: I do not like it

How do you see performance rating in cf?

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

    First, I should apologize that I did not show how to calculate performance in Codeforces in my blog. Thank you for your comment.

    Actually, in Codeforces, your approximate performance in contests/virtual is calculated as follows:

    • $$$p$$$ : Your rank in Codeforces contest
    • $$$a$$$ : Initial rating of participant who got rank $$$p$$$
    • $$$b$$$ : Rating change of participant who got rank $$$p$$$
    • $$$perf = a + 4 * b$$$ (approximately)

    For example, if you got 20th place in contest and rating changed from $$$2513$$$ to $$$2604$$$, your performance is approximately $$$2513 + 4 * 91 = 2877$$$.
    Another example is virtual contests. If you got $$$4200$$$ points and it was between $$$13$$$-th place and $$$14$$$-th place in actual contest, your performance is approximately the average of performance of $$$13$$$-th player and performance of $$$14$$$-th player.

    But there could be error of ~50 rating performance. So if you want to calculate more precisely, you can pick the rating change of several people who got very near rank and rating does not change so much.

    Sorry for not showing performance calculation formula in my blog.
    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +10 Vote: I do not like it

      I think you can also calculating it by finding the value of the rating for which the rating change of the virtual contest is 0, using this tool.

      I assume that if the rating change is 0 in some contest, then the performance is approximately equal the your rating.

      → Reply
      • »
        »
        »
        »
        4 years ago, # ^ |
        ← Rev. 3   Vote: I like it 0 Vote: I do not like it

        Woooooooow very good idea to calculate rating!
        From next time, I will use this idea. Thank you!

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

        Also, for a predictor of rating changes during the contest or much earlier than CF shows, you can use an extension with chrome here.

        → Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Thank you so much for your great contribution to the Codeforces community.

→ Reply
»
4 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Thank you for your tutorial !!!!!!!!!!!!!!! Love you so much !!!!!!!!!!!!! I want be the best !!!!!!!!!!!!!!!!!!!!!!!!!!!

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

A way to increase contribution from $$$0$$$ to $$$100$$$:

$$$0$$$-$$$20$$$: leave stupid comments

$$$20$$$-$$$40$$$: write a blog on how to increase contribution from $$$0$$$ to $$$20$$$

$$$40$$$-$$$60$$$: write a blog on how to increase contribution from $$$20$$$ to $$$40$$$

$$$60$$$-$$$80$$$: write a blog on how to increase contribution from $$$40$$$ to $$$60$$$

$$$80$$$-$$$100$$$: write a blog on how to increase contribution from $$$60$$$ to $$$80$$$

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

    Will you tell how to increase from 100 to 120?

    Just 17 points to write from 120 to 140 XD

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

    How about how to get minus contribution? Your comment is not too informative. Please review your shallow comment.

    → Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Astonishing effort, thank you!

→ Reply
»
4 years ago, # |
  Vote: I like it +13 Vote: I do not like it

It's about time you add a new character to your name and get the Nutella node in your avatar.

→ Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Thank you very much for your article. Because you didn't participate for so long on codeforces but you trained a lot, now you will probably get to constant IG no problem.

→ Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Thank you!

→ Reply
»
4 years ago, # |
  Vote: I like it +29 Vote: I do not like it

Very thank you for so many number of readers and so many comments.

I know that there are many, and countless number of people who want to gain rating in Codeforces. I'm really hoping that my blog is usable for some people. Also, I'm really hoping that tutorial blog will increase in Codeforces, because it can be very beneficial for readers and Codeforces users.

Anyway, I really appreciate for hundreds (maybe over 1000) of people who read my blog. Cheers!

→ Reply
»
4 years ago, # |
  Vote: I like it +14 Vote: I do not like it

Hi, which 50 topcoder problems to solve to get better, also how can I submit topcoder problems on the online judge.

→ Reply
»
4 years ago, # |
  Vote: I like it +15 Vote: I do not like it

You are awesome, thank you very much E869120, my goal is to be candidate master before finish this year, Just for curiosity, How many hours do you train per week?

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

    Because I have some classes in high school, on weekdays, I trains ~3 hours per day. On weekends, I trains ~8 hours per day. So, on average, I trains approximately 25-30 hours per week.

    But just before IOI was different. In Japan, there is summer vacation from late July to late August. So, usually, just before IOI is during summer vacation in Japan. So I was able to train 12-14 hours per day from 1-2 weeks before IOI.

    → Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Amazing!

→ Reply
»
4 years ago, # |
  Vote: I like it +13 Vote: I do not like it

Great job!

I enjoyed every page of your tutorial ;)

→ Reply
»
4 years ago, # |
  Vote: I like it +15 Vote: I do not like it

Hi! I remember you as one of the tomato twins. :)

I guess I'm the only one among the IOI18 golds, who had gone purple from orange after IOI. I always wanted to be a red coder, but now I know that I never practiced seriously for that. Maybe I just have been lost, forgetting how to practice.

This post is not only amazing itself, but it also reminds me that if there is a shining achievement, there should be corresponding efforts.

Congrats to you being a red coder, and thanks for your guidelines. Hope to see you again!

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

    Thank you! And hope to see you again!

    By the way, my mascot that I brought in IOI 2018 was not a tomato, but an apple :)

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

      Whoops, sorry. Its color was so tomato-ish. XD Thanks anyway!

      → Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

thank you

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

Oh,Chinese can't use Google. So can you give the link in another websites such as github.com?

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

    Sorry for replying very late, because I was busy for practicing for APIO.

    This is the link of my tutorial in github. Sorry for replying late, and thank you for mentioning that Chinese cannot use google. (I didn't know about that)

    → Reply
»
4 years ago, # |
  Vote: I like it +15 Vote: I do not like it

Does AtCoder release English editorials for ABC contests ?

→ Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Thanks for your help. You are kind hearted

→ Reply
»
4 years ago, # |
  Vote: I like it -14 Vote: I do not like it

Hoow to reach the level of gennady korotkevich or petr mitrichev ? any idea ?

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

Dear E869120 thanks to you for posting all your insights. I would like to know your opinion about Hackerrank problems. Do you ever use hackerrank for practice or do you think the other judges mentioned in your tutorial have more rich problems?

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

    Yes!

    2 years ago, I was solving hackerrank problems, and participating in hackerrank contests including "Week of Code" or "Hourrank". In my opinion, since many of hackerrank contests there are many partial scoring, if you want to practice for OI-like contests (IOI, APIO, POI, national selection camp for IOI) it is good idea to practice hackerrank.

    Since there are many typical problems in hackerrank, I think that if you think you are lacking of using typical algorithm efficiently, solving hackerrank is also a good idea. But if you want to improve skills to solve problems faster, or skills to thinking about solution, you should upsolve problems in AtCoder.

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

Hey, I wanted to know how can some people on codeforces are able to solve questions like just in a minute. They have a submission for A-type problem on 00:01 and for B-type problem on 00:03. How's that possible? if I only consider the reading time for question and then even copy paste the code it goes beyond a minute. Please suggest some tips to increase our speed like that.

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

    Actually it is not that hard ... 00:01 in CF actually means that the submission was made before the second minute of the contest. So 40 seconds to read problem statement and 1 minute 19 seconds to write code amd submit. Shouldn't be too hard for problem As in div 2.

    Also, you can watch the screencast of several GMs on youtube to see how they do it.

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

      Hey thanks, I was not aware that it's a 1 min and 59 secs game. And can u share some links of the screencast?

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

This is incredible !

I have been following your posts ever since you were a Candidate Master and this is a fantastic achievement ! Many Congratulations. I am quite proud of you.

Your tutorial is also quite helpful. Solving problems on AtCoder does do wonders.

Thank you very much for sharing the website kenkoooo. On AtCoder, we cannot see which problems we have solved in one screen and need to go to the Submissions page of each individual contest. This website is certainly very helpful. (Although now that AtCoder Beginner Contest has started including 6 problems, the interface of kenkoooo will also have to change. Not sure if they will be able to accomodate that.)

Wish you all the best !

May God bless you

→ Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Thanks for your experience.

"But getting average performance of rating 2400 is much more difficult than you think."

I have been stuck in orange for long time, and reached red by luck. I admit that I can't keep red. Training skill above 2200+ mentioned in your tutorial seems very useful to me.

→ Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

I'm weak at math.Can you drop some suggestions to grow decent knowledge on topics like combinatorics,probability,geometry etc.?Thank you for the tutorial!

→ Reply
»
4 years ago, # |
  Vote: I like it +25 Vote: I do not like it

Thanks for a great tutorial!

I disagree with some points but it's ofc. hard to say which method is the best. What I would recommend:

  1. Don't go to the editorial after some fixed time like 20 minutes of solving a problem. Give up only if you are stuck for 10-30 minutes (10 in case of easy problems, more for harder ones). As long as you have some ideas, do investigate them and maybe you'll solve the problem yourself.
  2. Upsolving problems is very important. This way you learn new things. After a contest or virtual participation, try to solve at least one more problem. This should be said early in the PDF, not only in parts about getting red rating.
  3. I don't think you should copy segment trees from your code library (reference document). It's better to struggle for some time and implement them every time. You will get faster and will understand them better. Plus this is a must for those who prepare for IOI. My friends and I implement seg-trees from scratch every time. I don't remember if I ever used to copy them.
  4. It's unnecessary to do "50+ virtual participations in CF". Just solve problems slightly above your level. Do some virtual participations if you want to.
  5. Consider changing "Make a routine that you will do just before the contest. It directly leads to the concentration during the contest." to "don't care about the contest, just have fun solving problems". I'm quite sure people perform better when they are relaxed (but not distracted).
  6. "Although I experienced competitive programming for 3 years, I think that I don’t know many techniques" — I think that's because you're doing too much virtual participation. You spend a lot of time on easy problems this way.
→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 4   Vote: I like it +21 Vote: I do not like it

    Wow great idea & suggestion from a coder once reached legendary grandmaster...! Thank you for your comment.

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

      Is this a variation of "Wow! cool post. Thanks for sharing."

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

    I don't quite care about rating and enjoy CF contests for fun. But when I go to IOI I can't quite do the same and I failed hard...

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

Hi did you wrote the IOI tutorial?

→ Reply
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Great thanks to this blog, I think I should practice much harder than before.

→ Reply
»
4 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Thanks a lot for the tutorial, very helpful!

I'm trying to solidify my rating above 1400. One problem I'm seeing is that I tend to do well on Div2-only rounds, but pretty poorly on combined rounds. I reached a peak rating of 1521, then lost 214 points in just 3 combined rounds (CF Global 3+4 and Forethought Future Cup).

Is it mostly weak "mathematical concepts and thinking" like your guide claims? If so, should I focus my practice on TopCoder to strengthen those? Specifically, Div1Easy?

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    To solve problem on combined round (ex. Codeforces Global Round), mathematical concepts are needed. For example, in the third problem on Global Round 4, the answer only outputs $$$2^{H+W}$$$ — definitely one great example of mathmatical problem. Another example is the fourth problem on Global Round 4, just think about loop which the degree of all vertex is 2, and adding some edges. Graph theory is also the main part of mathematics, and many people who are familiar with TopCoder SRM can solve this problem easily.

    I think that you are mainly stuck on problem with mathematical concepts. Solve TopCoder Div2Medium and Div1Easy. (I think that Div2Med is bit easy for cyans) I have three notices to solve TopCoder problems as follows:

    • Some of the round is very difficult — even 4 in 5 of Div1 participants could not able to solve during the contest. Check https://competitiveprogramming.info/ and you can check the difficulty of each problem.
    • Thinking long time is important for the introduction of solving TopCoder SRM. So in your pattern, don't give up for at least 60 minutes before looking editorial.
    • When you solve some problems on TopCoder SRM and you feel that your skill of mathematical concepts is improving, I recommend to solve SRM 600-719. They are bit difficult, but they are good for you.
    → Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I like it SO MUCH!

Thank you for working!

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

Good share！ My recent goal is to be a red man,LoL.

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

    You are a good man who always teach us learn how to solve the problems on codeforces at Bilibili! I love your videos very much! I believe that you coud be the red man and one day I will be the yellow man.

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

      As far as I know, a good man is an ambiguous phrase in Chinese.

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

        Sorry for my bad English

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

          Never mind, it's just a joke.

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

Thank you!

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

http://cfladders.rf.gd

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

    Wow...This site looks amazing. Its like A2oj ladders.But I am currently using a2oj ladders.Which one will be better to follow ? Did you use it? Is this be helpful for pupil like me?

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

      I just prefer practicing by setting difficulty range from the problemset itself. Are a2oj ladders or this link any better?

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

Thank u!

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

Thank you!

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

E869120 sir I can't solve atcoder beginner contes's problem C...and sometime can solve B.....What i should do?

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

    You should do what he says to do instead of asking him again.

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

I am unable to view the document. Can you provide a different method of sharing other than Google drive since for some reason I am unable to open Google Drive links

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

I think his method will be efficient for me to become specialist in a quick time,I have been doing virtual contests daily in Codeforces and solving A,B regularly but I still haven't been able to solve C during contest time.I have been feeling that something is missing.But I think if I combine his method of solving in AtCoder with my own, it will be really really helpful...Let's see what happens

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

    Aim higher, specialist (or even expert) is overrated :|

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

      I know that.I wanna be a red but I think I should try to proceed step by step

      → Reply
    • »
      »
      »
      16 months ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      I think I have a better reply to your statement today 10 months later :

      The world itself is overrated

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

Wow great blog, thanks.

→ Reply
»
18 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Hey! Is this form of practice still beneficial today? Just asking cause the blog is two years old.

→ Reply
»
6 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Great ideas! Thanks

→ Reply
»
7 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

I was having difficulties with which major algorithms to focus on specifically. Your blog(PDF) clears it all. Thank you for sharing the fantastic stuff.

→ Reply