I already learn Java Collection Frameworks, Arrays, String, Bit Manipulations, Bit Masking, Sliding Windows, Two Pointers, Recursion, and a little bit of Dynamic Programming, Mapping, and Set.
I already learn Java Collection Frameworks, Arrays, String, Bit Manipulations, Bit Masking, Sliding Windows, Two Pointers, Recursion, and a little bit of Dynamic Programming, Mapping, and Set.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Greedy algorithms are also important in Codeforces, but it may be beneficial to practice them more. If you truly master them, becoming a specialist or expert can become much easier.
Yeah, thanks for the tips. Any more suggestions ??
binary search. Also, practice solving Div. 2 C, you should consistently solve them in contest to be specialist
If you are a primary or secondary school student, or simply lack confidence in your math skills, it is very useful to study math in advance.
You can try this (sections 3-6).
this sheet problem is old
Is $$$1$$$ year ago old?
Also, they are not random problems, they are meant to be "useful" problems.
I've become specialist recently and I found out that to reach this rank, you don't need to study much more algorithms but it's about observation and implementation, try practicing a lot of low rating problems and code fast. good luck
bro i see you specialist in just 6 months? bro when i slv a problem, not have idea fast and observe also slow, suggest me bro
I do a lot of 800 rating problems everyday, about 30-50 problems a day. I try to get an idea and implement it in around 5 minutes, if I stuck for more, that's okay, I keep thinking until 30 minutes and it's time for me to have a look at editorial
bro, i heard : per ratings solve usually 60-70 is enough, but you solve 300+ , is it ok?
Maybe it's true for harder problems, but for solving 800 rating problems, it's not about learning more algorithms or tricks, it's about learning to code fast
You'll get the most out of your time by doing harder problems. If you're over 1200 there's no reason to be doing 800 rated problems.
Bro just solved everything in range 1500 — 1700 in 2 months. See you surely be cyan in no time.
div2 A, B, C problems are usually some kind of weird math observation or some construction observation. If it is not then it is probably just greedy or binary search.
So to be good at solving A, B, C you should just train solving them, also I would recommend solving only recent problems, because meta for first 3 problems change through time.
Codeforces problems in general are not just standard algorithm or technique problems. Usually it is something standard or obvious behind some 1-2 observations. I have noticed that div2 A, B, C more often than not require math observation. Sometimes for div2 D, E you can get something requiring constructive ideas or some non math observations + dp or greedy or binsearch or dfs/bfs or combinatorics(+modular arithmetics) or extremely rarely segment tree. In my opinion if you do not like math you wouldn't enjoy codeforces problems, as most of the times problems are inclined towards math.
Do basic maths and implementation based questions try doing the first two problems in div2 round really fast. Thats it.
be good at intuition. (sounds vague but works till candidate master)
The most and most important skill is speed according to me. I jumped from 1300 to 1432 when i solved A, B and C within an hour. Then again lost the specialist and jumped back from 1397 to 1521 are solving A, B and C in 42 mins. Yes but i still dont know Dynamic Programming, Trees and Graphs :(
Greedy, BS, DP are most important