I tried reading the editorial but cannot understand the solution to this problem
The main point which I cannot understand is why should S % gcd(N,K) be equal to 0?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
| Name |
|---|



Assuming that the throne is on position 0, then our current position becomes S. If we're moving in a circle then we are bound to follow a cyclic path. So we need both 0 and S to be on the same path.
In a cycle of length 'n', if you jump by 'k' steps then you can move as follows:
0 => gcd(n, k) => 2*gcd(n, k) => ....... (See this for yourself)
So, iff S % gcd(n, k) = 0, 0 can be reached from S after some moves.