Can anyone explain how to solve this 687B - Remainders Game . I don't understand how to come with ideas for such problems and I did not understand the editorial well.
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Can anyone explain how to solve this 687B - Remainders Game . I don't understand how to come with ideas for such problems and I did not understand the editorial well.
Название |
---|
If you know xmodc1,xmodc2,...,xmodcn then you can find out xmodlcm(c1,c2,...,cn) if the given values are not self-contradictory(eg. xmod2=0 and xmod4=1). Conversely, if you know xmodlcm(c1,c2,...,cn) you can find each of the given n values. So first find xmodlcm(c1,c2,...,cn) and this would retain all the information. Now, if k divides lcm(x1,x2,...,xn) you can easily find xmodk otherwise you can't.
The editorial proves that all you have to do is check whether $$$k \mid \text{lcm}(c_1, \dots, c_n)$$$. This is equivalent to saying $$$\gcd(k, \text{lcm}(c_1, \dots, c_n)) = k$$$. But we can calculate the left side very easily since $$$\gcd(k, \text{lcm}(c_1, \dots, c_n)) = \text{lcm}(\gcd(k, c_1), \dots, \gcd(k, c_n))$$$. The time complexity will be $$$O(n(\log(C) + \log(K)))$$$. Also there will not be overflow because the intermediate value will always be $$$\leq k$$$.
These identities hold because if you think of an integer's prime factorization as a multiset, $$$\mid$$$ corresponds to $$$\subseteq$$$, $$$\gcd$$$ corresponds to $$$\cap$$$, and $$$\text{lcm}$$$ corresponds to $$$\cup$$$