25 lines
389 B
C++
25 lines
389 B
C++
|
#include <iostream>
|
||
|
|
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
// 函数：计算最大公约数
|
||
|
|
int gcd(int a, int b) {
|
||
|
|
while (b != 0) {
|
||
|
|
int temp = b;
|
||
|
|
b = a % b;
|
||
|
|
a = temp;
|
||
|
|
}
|
||
|
|
return a;
|
||
|
|
}
|
||
|
|
|
||
|
|
// 函数：计算最小公倍数
|
||
|
|
int lcm(int a, int b) {
|
||
|
|
return (a / gcd(a, b)) * b;
|
||
|
|
}
|
||
|
|
|
||
|
|
int main() {
|
||
|
|
int M, N;
|
||
|
|
cin >> M >> N;
|
||
|
|
cout << lcm(M, N) << endl;
|
||
|
|
return 0;
|
||
|
|
}
|