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 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
2 | adamant | 163 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 147 |
7 | atcoder_official | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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.