Hello CPers, I am Jenil Mehta from Surat.
I can solve greedy & implementation problems only.
Can I become expert or I should learn any other topic such as graph?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 8 | SecondThread | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 01.05.2024 19:19:22 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
I think you should learn graph & dp as your title suggest you are new into CP.
I think you missed this blog
and this one
also this
Expert in what
stealing usernames, you should be competent!
you should solve as many as math problems like combinatorics ,summation ,modular arithemtic,gcd and lcm,because math problems takes half of contest problems,then learn graph theory and searches techniques like dfs,bfs,binary search,and solve many dynamic problems .you can reach expert fastly if you concentrate on these and first of them solve as many problems as you can daily.
One of the methods to increase your rating
https://codeforces.com/blog/entry/70721