Can anyone give me a hint to solve this problem https://codeforces.net/contest/1152/problem/C please? Thank you
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Can anyone give me a hint to solve this problem https://codeforces.net/contest/1152/problem/C please? Thank you
Name |
---|
try to make gcd as large as possible; gcd(a,b)=gcd(b-a,a)
let's suppose $$$a \leq b$$$, then $$$\gcd{(a + k, b + k)} = \gcd{(a + k, b - a)}$$$
$$$\gcd{(a + k, b - a)}$$$ is a divisor of $$$b - a$$$
for each $$$d$$$, divisor of $$$b - a$$$, we are trying to find such k that $$$\gcd{(a + k, b - a)} = d$$$
one more hint?
d is a divisor of a + k, so there is a integer n that a + k = n * d. Therefore, k = n * d — a. We also want k to be as small as possible, so n should be as small as possible.