给定两个自然数 $A$ 和 $B$。求一个自然数 $N$，使得 $A + N$ 和 $B + N$ 的最小公倍数 $\text{LCM}(A + N, B + N)$ 最小。
输入格式
输入唯一的一行，包含两个自然数 $A$ 和 $B$。它们均不超过 $10^9$。
输出格式
输出使得 $\text{LCM}(A + N, B + N)$ 最小的自然数 $N$。如果有多个 $N$ 都能取得最小值，输出其中最小的那个。
样例
输入样例 1
4 10
输出样例 1
2
QOJ.ac
QOJ
実行時間制限： 0.1 s
メモリ制限： 256 MB
満点： 100
#15574. LCM
統計
この問題は以下のコンテストで使用されています：
AI Translation —
This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.