Since I want to progress, I wanted to know what all algorithms should I learn and what should I do to increase my rating.
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
14:10:37
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
14:10:37
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.11.2024 03:24:23 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
Learn basic STL.
Then solve a lot of problems and upsolve them. This is the best way to improve.
As one LGM said, if you're not red — go learn binary search
Please explain why to learn binary search? I didn't get what you said
what I think he means is that jumping onto topics is less important and getting hold of what you're doing is more.
he also said that segment trees are important for beginners
ur not cyan lol
He wrote this blog from second account for privacy, I guess
What algorithms should I practice as a grandmaster? (Im also writing on an alt for privacy)
Practice binary search
To prevent negative contribution hehe
hahahaha , okay i will also start to use this technique.
but his recent contest history doesn't say that
CP Roadmap
Euler phi, sieve variants, trie tree, disjoint set union, binary exponentiation, modulo inverse/ Fermet's little theorem, topological sorting, dijkstra, floyd warshal, bellman ford, hashing, DP (coin dp, knapsack, LCS etc), segment trees, BITs etc. I also learnt some other DS and algos as part of my course syllabus like CRT, Edmond carp which I haven't found much use of. Also some other algorithms and techniques I learnt for fun like Sqrt decomposition, Mo's algorithm, Heavy light decomposition, Centroid decomposition have almost no uses below 2000 rating. I also learnt KMP, LCA, binary lifting. Problems related to these topics are fairly common in 1900-2000s. KMP is even found in 1700-1800s sometimes. It's a retarded thing to say that you don't need to learn algorithms. Not knowing the necessary algos can badly hinder your practice sessions especially if you are like me who hates looking at editorials
Lol, you're funny. You don't need to know all these. Stop deceiving yourself. You're going to remain cyan for a long time.
I am expert in my alt id, your point?
Lol, please. You were literally struggling to solve 4 problems in the last div3 contest. What is your alt so we see?
Alt id is alt for a reason. I wasn't struggling to solve 4 problems. I started half an hour late, and was sick so pretty much forcefully finished it. And I don't feel entitled to prove you a point, take it as you please
The highest number of problems you've solved on this account in a div2 contest is 3, and you expect me to believe you're expert somewhere? Lol I am also LGM on my alt. Rofl. Dumbass.
Then don't. I fail to see why you are getting triggered
This was your comment a few weeks ago, unsure of reaching expert and now you're expert? That's not even my business, what annoys me is the stupid list of topics you listed, even some reds don't know all those, and you think they are necessary as a cyan?
Yes, now I am. And you dug pretty deep into my blog history given that it's "none of you business". What is it that reds don't know? Point it out. In fact, you could do it in the very beginning. But instead, you kept badgering about how I will remain cyan for a long time
Yes, some of these topics are not necessary for cyans, you got the point, but I don't know why you assume that he doesn't know these topics. Studying Computer Science sometimes force people to learn algorithms and data structures, but simply knowing them doesn't mean you can successfully recognize them in problems and use them, and most of the time, you don't need to know any advanced topic to solve codeforces problem. And I think that reds in general know much more than algorithms listed here. Get some chill bro
What's up bigSchrodinger
I'm struggling with expert but I solve a whole Div.3 in average of 2 hours, so "I started half an hour late" should not be a reason.
also there's no reason to use an alt to post blogs
You are not struggling with expert. And you don't need to consistently solve whole div 3 to be above 1600. Regardless, I said it as it is. I only brought this up because somebody started nagging about how I will "remain cyan for a long time". It irritates me that I have to explain how I know what I am saying in a comment which has little to do with rating
bro got CM now lol
this comment remained so deep in my memory for some reason that I can't help to mention this
Ok, lmao
Btw, congrats on CM
In my opinion expert is attainable with some speed and being comfortable with applying these algorithms:
DFS
BFS
DSU
Binary Search
Memo DP
Sieve
Binary Exponentiation / Inv Mod
Prime Factorization