Hey everyone,

I want to know what concepts (ex**.implementation, sorting, greedy etc**.) do Div. 2 contests emphasize on. I need to know so I can improve on these areas so I can do better in future Div. 2 contests.

Thank you.

# | User | Rating |
---|---|---|

1 | tourist | 3687 |

2 | ecnerwala | 3600 |

3 | Benq | 3503 |

4 | ksun48 | 3421 |

5 | Um_nik | 3412 |

6 | Radewoosh | 3382 |

7 | maroonrk | 3323 |

8 | Itst | 3239 |

9 | apiadu | 3238 |

10 | ko_osaga | 3232 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 205 |

2 | SecondThread | 197 |

3 | Monogon | 195 |

4 | vovuh | 189 |

5 | Um_nik | 185 |

5 | pikmike | 185 |

7 | antontrygubO_o | 184 |

7 | Ashishgup | 184 |

9 | pashka | 169 |

10 | Radewoosh | 167 |

Hey everyone,

I want to know what concepts (ex**.implementation, sorting, greedy etc**.) do Div. 2 contests emphasize on. I need to know so I can improve on these areas so I can do better in future Div. 2 contests.

Thank you.

↑

↓

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/26/2020 21:53:41 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

I think you can look at problemset and find out which types of problems usually exist in div2 contests. But as you said it is often implementation, greedy, maths, constructive, brute force, strings, sometimes graphs.

Sometimes dp

I did'nt want to give a downvote . I just wanted to see what happens if there is no vote e.g.0vote ,what happens if anyone downvote it. I am so sorry as I didn't know I can not undo it.

In my opinion in C,D,E you can expect a lot of stuff since it already overlaps with Div1. But for strictly Div2 problems — A,B, they usually emphasize on coming up with some simple but clever idea or being able to quickly implement an annoying algorithm. They usually don't require a lot of coding and often don't have some well-known algorithm in them, hence the "implementation,sorting,greedy" tags.

When I was starting in Codeforces at first, I found out that the best way to be better at Div2 problems is to solve Div2 problems. I see you've done only one official competition so there are still 200+ competitions waiting for you. You can virtually participate and try to get the A,B right in the time limit, or simply practice (though I prefer virtual participation).

When I first joined Codeforces I would do tons of virtual competitions and that quickly improves your skill of solving those A,B problems. Good luck :)

Thanks Enchom

If we are kind of ok with solving Div 2 (A, B) questions what algorithms would you recommend to level up now to move on to C problems and above? Should i go for dp 1 st or should i go for trees and then eventually graphs from there?

How about just solve C problems and see what's on them...

I was meaning to ask which one should we go for first

And I am meaning that is a wrong way to think about it. Do not go by topic, just look at C problems and if you can't solve look at editorial and if there is topic you don't know learn that.

Ignoring that my comment is from 5 years ago, of course if you can comfortably do A, B you move on. Always challenge yourself.

Regarding topics, DP, trees and graphs in general are very basic so you will have to learn all eventually. There is no real benefit of prioritising one over another since you'll need them all if you want to do well.

Finally, for beginners I'm a proponent of the approach SuperJ6 mentioned — solve problems and learn the concepts that are needed to solve them. It will make progress more natural and applications of the topics will be more obvious.

Thank you Enchom for such a comprehensive answer.

... thank you for replying to such an old post even. XD

I don't know many basic data structures and algorithms like queues,trees,graphs.So should I learn them initially in this order or randomly pick any topic and learn it.