Yeah finaly I reached the pupil . Now, I want to become Specialist.What should I learn? Should I learn first graph theory then DP or first DP then Graph Theory?
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
30:21:56
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
30:21:56
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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
Время на сервере: 22.11.2024 11:13:05 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
First you need to master recursion then dp then graph
Should I learn DP??
Well first master recursion and backtracking then go to dp
Don't listen to him, he is not even specialist. How can he tell you how to become specialist if he has never been there? For specialist all you need to learn from graph theory is DFS, and you might need to learn some elementary DP, however I got to specialist without knowing it at all (I'm still bad at DP but that's a different topic). Go to USACO guide silver section, and learn all there is (except functional graphs), and practice 1500+ problems on cf, number theory is very frequent too for div2C, so you should know a bit about that (property of gcd, lcm, prime numbers...).
And binary search.
Congrats! I think DP problems appear more often than graphs
I can solve div2 A,B. What topic should i learn to solve C,D?
Check out this video https://www.youtube.com/watch?v=bSdp2WeyuJY
consistency is on another level..
Congrats bro, and I finally reached the specialist after a lot of effort :')
oh good. But what is your stratagy top reach specialist?
You solved a lot of problems (1600) :O, you solved a lot of problems that are easy for your rating, you need to solve difficult problems:
Try to solve problems in the 1500-1600 range, and only after these problems will be easy for you to solve, you are guaranteed to be an specialist, so if you want to achieve an X rating, then you need to solve problems in the range X + 100 — X + 200
Thanks bro ,any topic that should i learn?
thanks bro
Good luck bro, I believe that you will become a specialist
you didn't?
Practice 1200R-1400R problems and sometimes 1600R problems maybe. 1600R is much harder compared to 1400s, specially if you compare 1400s vs 1200s and 1600s vs 1400s. I would recommend learn basic graph theory first (dfs, bfs) then go for DP. Before starting dp, make sure you have a clear idea how recursion works. Moreover, DP is not just a single topic you can learn and start solving right away, it is a whole another dimension. So, mastering DP will require time. And most of the good DP problems I have seen are above 1700R. Below that range, dp problems are quite rare. Anyways, you can learn DP and graph theory concurrently once you have covered the basics, I don't see the problem.
After I saw your account statistics, I change my mind. Don't practice 1200 rating problems, practice 1600 only. Also, by the time I had 68 1400R solves, I was specialist already, why is your rating so low? How do you practice
Last few days..I solved a lot of 1400R problems.
Ok, that's good, solve 1600s as well. Also, when solving a problem rely on guides as less as possible. I used to spend days to months before deciding to take help from guide. Maybe that's what is decreasing your output. If you want to improve, then you will have to spend time on solving problems and thinking hard when solving problems
Thanks bro.can you suggests any good resources for dfs bfs?
You can search in youtube for the algorithm, also search for blogs in CF for problems related to dfs, bfs.
Btw, aren't you from BD? then follow this lecture: https://www.youtube.com/watch?v=K0N0VozQMnA&t=1347s&ab_channel=BangladeshAdvancedComputingSociety-BACS Follow this channel, it's helpful. Also you can find DP related videos here
Also, binary search is a very common topic at least in lower rating problems. Try mastering this topic, this is also easy to get into.
159 fucking contests !!
Logic building first
160 contests ? you are great man bro