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

#include <stdio.h>

int main() 
{
    long m,n,max,min,sum;//注意溢出
    scanf("%ld %ld",&m,&n);
    long t,r;
    while(m>n)
    {
        t = m;
        m = n;
        n = t;//交换m,n的值
    }
    //交换后m<=n
    long  a,b;
    a = m;
    b = n;
    while((r=b%a)!=0)
    {
        b = a;
        a = r;//最大公约数
    }
    max = a;
    min = (m*n)/max;//最小公倍数
    sum = min+max;
    printf("%ld",sum);


    return 0;
}