题解 | 小乐乐与欧几里得

#include <stdio.h>

int main() {
    long long n, m;
    long long GCD, LCM;
    scanf("%lld %lld", &n, &m);
    GCD = 1;
    /*int smaller = (n < m) ? n : m;
    int bigger = (n > m) ? n : m;

    int a = (bigger % smaller);
    int b =(smaller % a);
    int c =a % b;
    if (c == 0){
        GCD = b;
    LCM =(n * m) / GCD;*/

    long long a = n, b = m;
    // 使用循环实现完整的欧几里得算法
    while (b != 0) {
        long long temp = b;
        b = a % b;
        a = temp;
    }
    GCD = a;
    LCM = (n * m) / GCD;
          printf("%lld", GCD + LCM);


return 0;
}