最小公倍数=a*b除以最大公约数

#include<iostream>
using namespace std;

int gcd(int a, int b){
    do{
        int c = a%b;
        a = b;
        b = c;
    }while(b);
    return a;
}

int lcm(int a, int b){
    return a*b / gcd(a, b);
}

int main(){
    int a, b;
    cin>>a>>b;
    if(a>b){
        cout << lcm(a, b);
    }else{
        cout << lcm(b, a);
    }
    return 0;
}