题号:NC243694
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld
题目描述
We have two positive number

and

and want to calculate

, but we only know the greatest common factor
)
and least common multiple
)
of two numbers, so what is the smallest possible value of

.
输入描述:
First line contains two numbers
and
,%20%5Cle%20lcm(a%2Cb)%20%5Cle%2010%5E%7B18%7D))
输出描述:
First line contains one number, the smallest possible value of
.
示例2
输入
复制
999999999999999999 999999999999999999
示例4
输入
复制
100000007 10000001400000049