Hello codeforces. I need your help to reach CM. Can you tell me what algorithms, data structures need to reach CM?
Sorry for my poor english.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | ecnerwala | 3654 |
3 | jiangly | 3627 |
4 | jqdai0815 | 3620 |
5 | orzdevinwang | 3612 |
6 | Benq | 3586 |
7 | Radewoosh | 3582 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3474 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | atcoder_official | 155 |
5 | maroonrk | 153 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 145 |
10 | cry | 144 |
Hello codeforces. I need your help to reach CM. Can you tell me what algorithms, data structures need to reach CM?
Sorry for my poor english.
Название |
---|
You already look like you are growing consistently, keep doing what you are. I am sure you will! All the best :)
Thank you! but I don't know many algorithms and data structures, and I think algorithms and data structures need to reach CM.
Why do you think that you need knowledge of data structures or algorithms to get to CM? Just ask yourself how many times you didn't solve a problem in contest just because you didn't know the algorithm or data structure(I am not talking about Div. 2 F problems which you don't need to solve to get to CM). In my case, I don't remember a single time. Just keep practicing and you will get there.
hi, your rating graph is really impressive, you become expert in 2 months since become cyan
can you tell me little bit about what you have done during that time? special training or resource or etc.
I believe you will become CM soon though
Thank, you! I did practise.
(Here's the easiest (and worst) way to reach CM https://codeforces.com/profile/Psychotic_D.) You were faster than me in edu 168. I think you probably should learn some more general ideas and techniques such as using sqrt(N or Q) or using segment trees. I'm pretty sure you'll reach Master soon.