i have been on cf for about 7 weeks most of the problems i solve are problems A division 2 and some times i cant solve them now i am at a stage where i am feeling that i cant solve any problem can any one give me some tips to improve myself as i dont know what to do and sorry for poor english
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.12.2024 04:43:20 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
.
C'mon man! It's only been 7 weeks. Take a look at my graph in comparison to yours!!
If you say you feel you can never improve, take me at least as an example! I have been coding for 6 months roughly. You just have to motivate yourself. As for improving, I would say A2OJ Ladders are a good start. I have improved a LOT because of it. Last thing would be to keep believing in yourself and keep practicing and participating. I don't know if I am eligible to give someone advice but this would still be my say.
How to merge graphs of two users?
There was some extension as I remember, can't find tho
Errichto This is the extension I used: Codeforces Enhancer
thanks!
the name of the extension is codeforces enhancer
Which specific ladder in A2OJ...The ones divided on basis of ratings or the ones divided on basis of division(Div2A,Div2B....)?
As long as you are solving problems where you need to think for some time and as long as you are not skipping problems that you can't solve it really doesn't matter. It's not like one of those ladders is magic or something. You just need to solve problems that are hard for you.
I normally do the ones divided on the basis of division. I have problems with solving C but I can solve almost any Div2 A and B, so I work for C right now. I did the same thing for practicing with A and B too.
I have only three advices: work,work and work!
There is no shortest path to succes in CP , Dijkstra.. You have to practice a lot :)
There is a shortest path to success in CP. Just that it is NP-hard to compute. So the graph is just not suitable for applying Kidd's O((V+E)log(V)) single-source shortest path algorithm.
he is Dijkstra., not Kidd
What happened to "ROFL" and "Lololo"?