| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 8 | nik_exists | 131 |
| 10 | Proof_by_QED | 130 |
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://codeforces.me/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