Hello everyone From past 2 contest we get interactive problems in the contests which i found so difficult to solve, this is my first time when i solved the interactive problems for the very first time so i need your suggestion from where to practice problems like this and more over this how to efficiently approach these type of question... Any suggestion in the comment box will be appreciable
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
16:44:31
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
16:44:31
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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
Время на сервере: 23.11.2024 00:50:30 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
Go to the Codeforces problemset, select the interactive tag and practice problems slightly above your rating.
good idea
i will try for sure
Consider Binary Search.When meeting interactive problems about permutations, try to find 1 or n first, then also try Binary Search.
Like CF1918E。Although its 2200, but you can use the way i suggest you.
find 1 and n first. Then try Binary Search.
okay
Another easy interactive problem likes CF1937 C.You should now that a | a equals a.
Then you find n and the number x that n ^ x is the maxium.
When you want to find number that is kth.Also try Binary Search.
This is a very basic one.
lightOJ problem
cf 1520F1
Another basic problem for practice 1924F - Анти-прокси посещаемость
Thanks for sharing!!!
Are you sure it is a basic problem it is 3500 rated...?
It's a good warm up for sure
that is something that you must find out for yourself