题解 | 小乐乐与欧几里得
小乐乐与欧几里得
https://www.nowcoder.com/practice/da13e0cf321e4df9acd0fdf0a433cbb0
#include <stdio.h>
long long GCD(long long x, long long y)//最大公约数
{
long long t = 1, z = 1, m = 1;
if (x < y)
{
z = y; t = x;
}
else
{
z = x; t = y;
}
while (m != 0)
{
m = z % t;
z = t;
t = m;
}
return z;
}
long long LCM(long long x,long long y) //最小公倍数=两数相乘除以最大公约数
{
long long z = GCD(x, y);
return (x * y) / z;
}
int main()//主函数
{
long long a = 0, b = 0;
scanf("%lld %lld",&a,&b);
long long c = GCD(a, b);
long long d = LCM(a, b);
printf("%lld",c + d);
return 0;
}
查看7道真题和解析
