九度oj 题目1438：最小公倍数

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 int gcd(int a, int b){
 7     if(b == 0)
 8         return a;
 9     if(a < b)
10         swap(a, b);
11     return gcd(b, a % b);
12 }
13 
14 int main(){
15     int a, b;
16     while(cin >> a >> b){
17         int g = gcd(a, b);
18         cout << a / g * b << endl;
19     }
20     return 0;
21 }