Q1.What can I do to become a specialist by looking at my graphs and practitioners? Q2.How to solve any problem quickly? Q3.Give me some source , where to do practice
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Um_nik | 163 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | awoo | 158 |
| 6 | atcoder_official | 157 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 148 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 20.09.2024 15:40:12 (l2).
Десктопная версия, переключиться на мобильную.
При поддержке
Learn BS properly. Thanks me later.
BS ?
Binary Search
How can learning BS help him to become specialist? I don't see it in a lot ABC div2 contests
you will see in problem C div 2 that binary Search, Ordered Set, prefix Sum, and when you have to select a range in the array(subarray) (i, j), you iterate over i and binary Search j. These techniques are used very frequently.
actually for subarrays you can use two pointers
In Every 1/2 contest there must be a binary search question. That's was fun but really true for to be specialist (:
Solve more 1600-1700s and spend hours on them. btw I'm ~1800 rated but I practice 2200-2400 and can sometimes solve them after lots of time, so 1600-1700 is reasonable
You can learn some basic algorithms, such as greed, binary search, binary answer, prefix sum, difference, dynamic programming and so on. In my opinion, usually the first three questions in the div2 competition almost do not use difficult algorithms. They are basically thinking questions. You can boldly make reasonable guesses and try to prove your answers. At the end of a competition, you can try to continue working on one or two problems that you did not work out in the competition. First of all, you can try to think for yourself. If you don't have any ideas within ten minutes, don't waste your time. Go to see the answers in time. Only through continuous accumulation can you improve. You can't only do what you can do in every competition. You should jump out of the comfort zone and challenge yourself to make progress.
first of all stop practicing problems which are rated below 1400. You have solved a hell lot of easy problems. set a rating range of 1400-1600 or 1500-1600 go to page 2 or 3 and just start solving each problem line by line. This worked for me.
Q3.Give me some source , where to do practice
I am using this site C2Ladder by codemastercpp and this site has a really good set of problems for each rating range. You should give it a try.
yeah me too
practice daily 2-3 question of avg 1200 for 10 days
I think this repo will be helpful for you : Repo
You need to spend more time in coding. Problems over 1500-1700 level need to be solved and you need to have a good idea about the basics of graphs, trees, binary search and bits.... and "Stop Chatting with Girls”..because it wastes your important time ...I think the last one is the main obstacle on your way to becoming a specialist...
Just become an Expert and lose 100-200 rating