| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Hello, I am trying to solve the Josephus Queries (Mathematics section) problem, and I am not able to code the logic that is iterative and not recursive.
I am really trying hard to get through this problem, I just completed the introduction and graph sections.
Looking forward to help.
Thanks in advance.
Why does it have to be iterative? A recursive solution is probably easier to implement
ordered_set is a cheatcode if u really wanna solve it
Can you elaborate a bit more on this? I tried thinking in this way but not able to pick up!
Just simulate the process and use ordered ser from gnu pbds
How do you simulate the process using ordered_set for n=10^9?
It would be great if you share any of the insights for iterative solution.
https://mirror.codeforces.com/blog/entry/82103
Thank you for sharing, I am aware of this blog and solution it contains is recursive. I am looking out for iterative intuition.
copy paste the code given into chatgpt and tell it to do iterative, i think it will work