题解 | #小乐乐与欧几里得#
小乐乐与欧几里得
https://www.nowcoder.com/practice/da13e0cf321e4df9acd0fdf0a433cbb0
#include<stdio.h>
int main()
{
//输入两个数
long long m = 0, n= 0,mul = 0,rem = 0,temp = 0;
scanf("%d%d",&m,&n);
//辗转相除法求最大公因数,用公因数求最小公倍数
if(m < n)
{
temp = m;
m = n;
n = temp;
}
rem = m % n;
mul = m * n;
while(rem != 0)
{
m = n;
n = rem;
rem = m % n;
}
rem = n;
//输出
printf("%lld",rem + (mul / rem));
return 0;
}
查看8道真题和解析