题解 | #小乐乐与欧几里得#
小乐乐与欧几里得
https://www.nowcoder.com/practice/da13e0cf321e4df9acd0fdf0a433cbb0
#include <stdio.h>
int main() {
long n = 0;
long m = 0;
scanf("%ld %ld", &n, &m);
long num = n * m;
long k = n % m;
//要知道一个知识点:
// n和m的最小公倍数 = n*m / n和m的最大公因数
while (k)
{
n = m;
m = k;
k = n % m;
}
printf("%ld\n", m + (num / m));
return 0;
}
查看23道真题和解析