CF1152C.Neko does Maths

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Neko loves divisors. During the latest number theory lesson, he got an interesting exercise from his math teacher.

Neko has two integers $a$ and $b$ . His goal is to find a non-negative integer $k$ such that the least common multiple of $a+k$ and $b+k$ is the smallest possible. If there are multiple optimal integers $k$ , he needs to choose the smallest one.

Given his mathematical talent, Neko had no trouble getting Wrong Answer on this problem. Can you help him solve it?

输入格式

The only line contains two integers $a$ and $b$ ( $1 \le a, b \le 10^9$ ).

输出格式

Print the smallest non-negative integer $k$ ( $k \ge 0$ ) such that the lowest common multiple of $a+k$ and $b+k$ is the smallest possible.

If there are many possible integers $k$ giving the same value of the least common multiple, print the smallest one.

输入输出样例

输入#1
```
6 10
```
输出#1
```
2
```
输入#2
```
21 31
```
输出#2
```
9
```
输入#3
```
5 10
```
输出#3
```
0
```

说明/提示

In the first test, one should choose $k = 2$ , as the least common multiple of $6 + 2$ and $10 + 2$ is $24$ , which is the smallest least common multiple possible.

首页