Can anyone give me a hint to solve this problem https://codeforces.com/contest/1152/problem/C please? Thank you
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can anyone give me a hint to solve this problem https://codeforces.com/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.