题解 | #求最小公倍数#

#include <algorithm>

using namespace std;

int main() {
    int x1,x2;
    while(cin>>x1>>x2){
        int out;
        int mi,mx;
        mi=min(x1,x2);
        mx=max(x1,x2);
        out = mx;
        while(out!=0){
            out = abs(mx-mi);
            mi = min(mx,mi);
            mx = out;
        }
        cout<<(x1*x2)/mi<<endl;
    }
}