题解 | 求最小公倍数

#include <iostream>
using namespace std;

// 欧几里得算法求最大公约数
static int gcd(int a, int b) {
    while (b != 0) {
        int tmp = b;
        b = a % b;
        a = tmp;
    }
    return a;
}
static int lcm(int a, int b) {
    return a * b / gcd(a, b);
}



int main() {
    int a, b;

    while (cin >> a >> b) {
        cout << lcm(a, b) << endl;

    }

    return 0;
}