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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
Название |
---|
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.