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

#include <stdio.h>

long long gys(long long m, long long n) {
    long long temp;
    if (m < n) {
        temp = m;
        m = n;
        n = temp;
    }
    while (n != 0) {
        temp = n;
        n = m % n;
        m = temp;
    }
    return m;
}

long long gbs(long long a, long long b) {
    return a * b / gys(a, b);
}

int main() {
    long long x, y;
    scanf("%lld %lld", &x, &y);
    long long max_gys = gys(x, y);
    long long min_gbs = gbs(x, y);
    printf("%lld\n", max_gys + min_gbs);
    return 0;
}

上一个题解没有考虑，mn的大小，虽然oj通过了

.