dr.owl's blog

Recent Contest Analysis: Breakdown of Topics
By dr.owl, history, 6 weeks ago, In English

Hello, Codeforces Community!

I have analyzed the topics covered in a recent set of problems, and the results are here. This analysis could help you understand the distribution of different issues and focus your preparation on more familiar topics.

Topic Distribution:

  1. Greedy: 63
  2. Math: 54
  3. Brute Force: 43
  4. Implementation: 37
  5. Data Structures: 36
  6. Dynamic Programming (DP): 30
  7. Constructive Algorithms: 24
  8. Binary Search: 20
  9. Combinatorics: 16
  10. Sortings: 14
  11. Number Theory: 14
  12. Bitmasks: 11
  13. Trees: 10
  14. Two Pointers: 10
  15. Graphs: 9
  16. DFS and Similar: 9
  17. Strings: 6
  18. Games: 6
  19. Interactive: 6
  20. Divide and Conquer: 6
  21. Hashing: 4
  22. DSU: 3
  23. FFT: 3
  24. Geometry: 3
  25. 2-SAT: 1
  26. String Suffix Structures: 1

If you're preparing for contests, focusing more on these topics might be a good idea.

Happy coding, and good luck in your future contests!

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

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

Please do it by rating, DP seems popular but i never saw an only-DP problem in <= 1700

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

    Till 1200, you need only the first four - Greedy - Math - Brute Force - Implementation

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

      I think that is a bit misleading to give dp too much priority(even more than binary search) when ABC(which is enough to reach expert and probably the target of people who read this) definitely has more binary search problems than dp.

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

        It makes sense but blog is just the frequency of topics. In between, binary search and dp are critical topics, but if you are in the starting phase, learn binary search first.

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

      What about after 1200?

      → Reply
»
5 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

dr.owl orz

→ Reply