输入2个正整数A,B,求A与B的最小公倍数。
Input
2个数A,B,中间用空格隔开。(1<= A,B <= 10^9)
Output
输出A与B的最小公倍数。
Input示例
30 105
Output示例
210
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int m = a;
int n = b;
if (a < b)
{
int temp = a;
a = b;
b = temp;
}
int c;
while (b != 0)
{
c = a % b;
a = b;
b = c;
}
cout << (long long int)(m/a)*n << endl;
return 0;
}