| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
I was looking at the Josephus Problem II in the CSES problem set, and couldn't find a c++ solution that didn't use ordered_set, which is not in the standard library. This made me wonder if I need to learn about other libraries to get good at cp. Any input appreciated.
Also if someone knows how to solve the Josephus Problem II only using the standard library please outline it for me ty
my code here.
You essentially brute force the algorithm by finding the next person by literally locating the k'th person to the right.
The ordered set is needed in some solutions for querying "kth largest in a set of integers". Such queries can also be done by walking on segtrees as well.
I have solved it using binary search & BIT.
code