C++ 代码
#include <iostream>
#include <numeric>
using namespace std;
//最小公倍数 = 两数乘积 / 最大公约数
int lcm(int a, int b){
return a * b / gcd(a,b);
}
int main(){
int a, b;
cin >> a >>b;
cout << lcm(a,b) << endl;
return 0;
}
#include <iostream>
using namespace std;
int lcm(int a, int b){
int max = a>b?a:b ;
int min = a<b?a:b ;
int n = max;
while(true){
if(max%min == 0){
return max;
}
max+=n;
}
}
int main(){
int a,b;
cin>>a>>b;
cout<<lcm(a,b)<<endl;
return 0;
}
tql