What are the topics should I learn before 1600 (Expert)? if you can share some tips to help me in my training tell me, please thanks for your response
What are the topics should I learn before 1600 (Expert)? if you can share some tips to help me in my training tell me, please thanks for your response
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
FFT
I think fft would bring you into at least 2200, possibly red.
Greedy, dp, bfs and dfs, binary search, some knowledge about binary, fast solving and some implementation are the only things you need to do.
Can u pls explain What is binary,fast solving ?
The binary is expressing numbers by 0 and 1, there are lots of operation on it. Fast solving is just solving problems fast.
Oh I thought they are combined terms. Thanks
thank u so much :D
Please also tell me topics required for CM?
https://cp-algorithms.com/ This page is really good to learn algorithms There are most topics with applications and problems.
This is the original version of the website, it is in russian http://e-maxx.ru/algo
thank u so much :D
expert = implementation fast, candidate master = expert + dp, graphs, combinatoric,
I think Practicing DP/Greedy/DFS/BFS/Binary search/MST/String based questions. and fast solving will be sufficient for becoming expert.
There is nice website CSES. On this website collected a lot of classical problems.
I think there are no topics for concrete learning. You need to solve many problems and get more experience. Solve dynamic programming, greedy, realization, binary search, graphs problems.
For example, you need to have intuition where you should use
dp[i] = ans for prefix i
ordp[l][r] = ans for subsegment [l..r]
.Also, solve math problems to get useful ideas.