| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hello everyone!
I created this simple training that contains 100 Problems "graphs, dfs and similar, dsu".
Difficulty of problems from 1200 to 1700
Group link: Graphs Problems
Welcome all suggestions for improving training
Good luck everyone!
Oh,that's really good!
"Graphs, dfs and similar, dsu" ----> this is really important for beginners!
Thanks. :)
Can you suggest something for the graph modeling problem? I know the theory but most of the code forces problems are not directly based on graphs. I have to identify that the problem can be converted into a graph and then apply some graph algo which seems to me too difficult.
Bro now im also facing the problem watched video from luv for graph and came to the codeforces graph tag with maximum submission, but I couldn’t understand their statement it seem very difficult to me, like which one is the best way to practice, as i see you has a nice progress and you went with this phase in recent times, so I believe you can guide me better way.i am really hoping of your helping hand, thank you vai, god bless you.
Till you reach 1500 I don't think the graph(+Tree) needs but if you want to learn then in my case only practice works, With time you will realize whether the graph can be applied on not. Poblems below 1500 rating questions on the graph need a basic understanding of the graph and standard algo.
Sounds cool (:
Could u make a list of string problems?
Problem 1: A + B (String version)
Take in two strings and concatenate them in sub-O(n) time.
Constraints: |A|, |B| <= 1e9
How do pick the problems ? I think a 1200 problem that involves core graph knowledge is not very likely to exist.
could you make one on DP??
haha this is helpful since i can solve problems of any rating without knowing.. i wont be scared when i see a high rating. thanks!
wow , thank you ! , is same good stuff available for other topics also like binary search , dp ? please provide if u have.
good problemset