题目链接:https://www.nowcoder.com/acm/contest/135/H
签到题,有个坑点是因为数太大了,所以在计算lcm的时候先除以再乘
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll unsigned long long
using namespace std;
ll n,m;
int main()
{
cin>>n>>m;
ll ans = __gcd(n,m);
cout<<n/ans*m<<endl;
return 0;
}