HDU - 1108 最小公倍数 (欧几里得算法)

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <cmath>
using namespace std;
typedef long long ll;
int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}
int main()
{
    int a, b;
    while(cin >> a >> b){
    cout << a * b / gcd(a, b) << endl;}
    return 0;
}