There's has been dfs and dp problems more frequent on div#2 C than before. Would you consider suggesting those ( graphs and dps ) to the people who haven't been able to reach "Expert" ?
posting issues
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/29/2026 16:12:42 (g2).
Desktop version, switch to mobile version.
Supported by
Yes, you should know Graph Theory basics atleast. Don't think too much about your rating, keep coding and learning, and don't GIVE UP .. Eventually, you will reach Expert.
HAPPY CODING...
This is such a positive comment, why is he getting downvotes. The community is cruel and do judge people base on their rating.
I love how people people treat rating as if it has the historical prejudices and background of race. "Community is cruel", lmao you realize it is just a negative number next to a comment, and probably because the fluff wasn't helpful and essentially could be shortened to "Yes, at least graph theory," though I wouldn't downvote it, but also he isn't in a position to give advice about being expert obviously.
All the 'ratism' talk is so stupid, you're not oppressed, people almost always aren't downvoting you because of your color, and you probably have low color because you don't practice, which is fine if you don't care much, but you don't need to then say how oppressed you are because you don't practice. Of course this wasn't justwitty saying he was said he had something cruel done to him, and I find it even worse when higher colors are acting like their supporting some righteous cause that results from ignorance and shifting blame. Also, of course a community based on programming 'competitions' is going to judge based on rating lmao, but probably not much for comments unless they're about I'm working so hard and not improving or saying things without the merit to say them.
If he's not a expert then it doesn't mean that his answer was wrong. Talking about 'ratism', you just did it right now by saying that the guy has no right to give an advice just because he's not blue. The community will obviously judge people based on their colors but not this time because you're wrong and a higher rating doesn't give you the right to make other feel inferior.
I didn't say he has no right to. I said that is a reason why people would downvote it though, why would people want to listen on advice how to get blue by someone who has not? Imagine you asked what is it like growing up black and a white guy responded, even if his response is correct, would you want to listen to him? Is it racism not to? I even said I wouldn't downvote it though, as I think it's a reasonable comment.
SuperJ6, trump has better opinion about this
I don't think trump has an opinion on ratism.
I think DFS , BFS and Strongly connected component are some topics which you can see in contests.
I've never found a Strongly connected component problem in div2C.
Based on Dr. Mostafa Saad junior training sheet which I highly recommend (the only problem is that videos are on Arabic you can use Cp algorithms to learn algorithms or any other online resources) :
you need to learn dfs bfs mst + dsu Dijkstra
Ps : if you know an algorithm it doesn't mean that you can solve every problem using it.
focus on solving problems instead and if you get stuck, check the editorial if you find a new algorithm, go learn it
https://mirror.codeforces.com/problemset/problem/427/C (SCC)
This problem is in the sheet you mentioned.
Yes i agree SCC is not that frequent and sometimes it can be solved using two pointers but whats wrong being on a safe side ?
Okay you are right this is a corner case xD
Its okay man.
Yes, a question on it comes quite frequently.
Not necessarily, I have seen an orange who wasn't good in graph and tree related problems but was extremely good at solving other types. But knowing about it would definitely be good.
What constitutes "other types"?
Like combinatorics, bitmasking, dp, number theory, greedy...
Indian niggas codeforces starter pack :
Think everyone should listen them
Has rating less then 1800
Usually same code is submitted by group of 8 to 10 peoples
Profile pic taken from anime (We know you are cartoon)
Quarrel among themself like ancient peoples (not to say about blog of that indian guy who cheated in codejam that remained in discussion for so long)
IQ less then 50
Don't know graphs,trees etc.
And not mention they are infinite in number
says a person who himself hides behind some random alt account. if you are real comment this from your original id. let us see your ratings?
And when you don't understand an algorithm, you go and watch the Indian guy's video on Youtube. Guess who's got IQ less than 50
DELETED
That's why you should know the context before teaching statistics, geography and perspective to others XD
Yes, you are right. Helpful resource.
Just get basic dfs. You should be focusing on using std data structures and get better at observation.
Good question! Actually, I'm not really sure whether there have actually been more Div2C (or, equivalently, Div1A) problems about graphs and dp lately. However, yes, I would definitely recommend that newcomers to the community read up on these topics, as they are fairly common concepts used in a wide array of problems, and it certainly won't hurt to learn them.
However, if your goal is to reach expert, I would say a lot of advanced graph/tree/dp techniques are not really necessary. Most interesting Div2C/D level problems that use these concepts have their difficulty come from observation followed by a simple classic algorithm. For graphs, I would say knowledge of bfs, dfs, union-find disjoint set is enough for a lot of problems, maybe dijkstra if really necessary. For dp, I would say that the most simple understanding of how to construct dp states and transitions should be able to get you past expert no problem.
Of course, most of this is from my personal opinion and experience, so take it with a grain of salt. Also, it's probably possible to get to at least expert rating without knowing a lot of graph and dynamic programming ideas, since there are also a lot of problems on codeforces about standard data structures, mathematics, binary search, magical observations and the like. For those wishing to practice on graphs and dp, however, I have linked some Div2C/D problems from past rounds I have taken part in here. (Or you could just go to problemset and filter by the appropriate tags.)
Fun fact: I've never written a dijkstra.
Yes. These are two of the most common div2C problems. And they also help on a higher level.
You can reach expert without knowing graph and dp. (I never solved a graph or dp problem in contest).
But it is better to learn those two topics as they are very much important and will help you to reach expert fast.
I strongly agree with this. I personally used to hate graphs, and never bothered to learn them until I reached 1700. Up to now, I have never used more than a BFS or a DFS in a single contest. DP is usually D and beyond; you will get your occasional C sometimes though. That being said, you need very firm implementation and problem-solving skills and you will comfortably make it to expert without any special techniques. Just solve what you like solving. Keeping that in mind, if so many topics in CP turn you off you should ask yourself whether you're spending your time doing the right thing.
I think you shouldn't put any limit of knowledge to achieve a certain rating. Just try to learn these concepts. if these concepts are too hard for you to absorb, just lay it out and learn things you can absorb easily and go back when you are stronger. Note that you shouldn't judge yourself and demotivate, it is just you didn't familiar with these kind of patterns. Always trust in the process. If you come to a problem and always wonder if it relate to graph or dp, you barely solve it. Instead, try to solve and learn required knowledge, it didn't that much hard as you think.