题解 | #求最小公倍数#__huawei_no.108-1

#include <iostream>
using namespace std;

int main() {
    long a, b;
    cin>>a;
    cin>>b;
    long gcd = 1;
    for( long i = 2; i <= min(a,b); i++ ){
        if((a % i == 0) && (b % i == 0)){
            gcd = i;
        }
    }
    long lcm = (a / gcd) *(b / gcd) * (gcd);
    cout << lcm;
    return 0;
}
// 64 位输出请用 printf("%lld")

简单粗暴