#include <iostream>
using namespace std;
unsigned long long gcd(unsigned long long a,unsigned long long b)
{
if(a%b==0) return b;
else return gcd(b,a%b);
}
int main()
{
unsigned long long a,b,s;
cin>>a>>b;
s=gcd(a,b);
cout<<s*(a/s)*(b/s);
return 0;
}
最小公倍数
最新推荐文章于 2020-12-11 16:46:30 发布