is any suggestions for solving 900-1200 rating problems.. which topics is more important in this particular rating ??
→ Обратите внимание
До соревнования
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
39:53:36
Зарегистрироваться »
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
39:53:36
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 29.11.2024 01:41:24 (j3).
Десктопная версия, переключиться на мобильную.
При поддержке
greedy , constructive algorithms, greedy, simple math, implementation, greedy, simple bruteforce , . . . greedy
Thank you bro. Can we add Number theory in this list?
short answer no
Try to solve lower rated problems on greedy and basic math(till u reach 1100-1200) then binary search / prefix sum .
Try to solve as many problems as possible! To get to 1200, you should solve, A, B problems in a div.2, or A, B, C, D, E in a div.4. Also, don't stress too much about rating! As you solve harder problems, so will you rating increase with it. The main ideas you should know would be greedy, some VERY light number theory, constructive algorithms and binary search. For binary search you can do the EDU section on Codeforces, it is excellent.