51NOD-01012 最小公倍数LCM

Posted 2020-09-20 ONION_CYC

【算法】欧几里德算法

#include<cstdio>
int gcd(int a,int b)
{return b==0?a:gcd(b,a%b);}
int main()
{
    int a,b;
    scanf("%d%d",&a,&b);
    printf("%lld",1ll*a*b/gcd(a,b));
    return 0;
}

View Code