同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

21605_Number

2022-5-16 18:19| 发布者: Hocassian| 查看: 23| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-4-89505681718100-Problem List-采集的数据-后羿采集器.html

Pro.ID

21605

Title

Number

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21605

AC

Submit

102

Ratio

21.57%

时间&空间限制

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

Given the greatest common divisor (GCD) and the least common multiple (LCM) of two integers a and b ( a ≤ b ), please find the minimum of b-a.

输入

Input may consist of several test data sets. For each data set, it can be format as below: There is just one line containing two integers, the GCD and the LCM, both are between [1, 10⁹].

Input is ended by GCD = LCM = 0.

输出

Description

Given the greatest common divisor (GCD) and the least common multiple (LCM) of two integers a and b ( a ≤ b ), please find the minimum of b-a.

Input

Input may consist of several test data sets. For each data set, it can be format as below: There is just one line containing two integers, the GCD and the LCM, both are between [1, 10⁹].

Input is ended by GCD = LCM = 0.

Output

For each data set, output one integer representing the minimum difference of a and b can be found, and then output a, then b, separated with only one space. If more than one pair of a and b can be found, output the one which has minimum a.