题解 | #小乐乐与欧几里得#

#include <stdio.h>
//辗转相除法
int main() {
    long long n, m = 0;
    scanf("%lld %lld", &n, &m);
    long long max = 0;
    long long min = 0;
    long long tmp = 0;
    //先将n和m进行保存，防止下面使用辗转相除的方法影响n和m的值
    long long a = n;
    long long b = m;
    while (tmp = n % m) {
        n = m;
        m = tmp;
    }
    max = m;
    //最小公倍数=n*m/max
    min = a * b / max;
    printf("%lld", min + max);
    return 0;
}