[原理]a、b 两数的最小公倍数为两数的乘积除以它们的最大公约数。
代码如下:
#include <iostream>
using namespace std;
unsigned short gcd(unsigned short a, unsigned short b);
int main() {
unsigned short a = 0, b = 0;
while (cin >> a >> b) {
cout << a * b / gcd(a, b) << endl;
}
return 0;
}
unsigned short gcd(unsigned short a, unsigned short b) {
return b != 0 ? gcd(b, a % b) : a;
}
其中,函数 gcd 为求最大公约数。