源代码
#include <iostream>
using namespace std;
int x, y;
int gcd(int x, int y);
int lcm();
int main() {
cin >> x >> y;
cout << lcm() << endl;
return 0;
}
int gcd(int x, int y) { //求最大公约数
int r = x % y;
while (r != 0) {
x = y;
y = r;
r = x % y;
}
return y;
}
int lcm() { //求最小公倍数
return x * y / gcd(x, y);
}