题解 | 小乐乐与欧几里得

#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;
    for(int i =smaller;i >= 2;i--){
    if( n % i == 0 && m % i == 0){
        GCD = i; 
        break;
    }
    }
     LCM =(n * m) / GCD;
        printf("%lld",GCD + LCM);
    return 0;
}