题解 | #小乐乐与欧几里得#
小乐乐与欧几里得
https://www.nowcoder.com/practice/da13e0cf321e4df9acd0fdf0a433cbb0
#include <stdio.h>
int main() {
long long n, m, c;
scanf("%lld %lld", &m, &n);
long long x = n; //记录初始值
long long y = m;
//求出最大公因数
while (m != 0)
{
c = n % m;
n = m;
m = c;
}
//求出最小公倍数
long long p = (x * y) / n;
//和
long long sum = p + n;
printf("%lld", sum);
return 0;
}