ZJUT_OJ1178 最小公倍数

 

Description:

求两个正整数的最小公倍数。

 

Input:

输入数据含有不多于50对的数据，每对数据由两个正整数(0&ltn1,n2&lt100000)组成。

Output:

对于每组数据n1和n1，计算最小公倍数，每个计算结果应占单独一行。

Sample Input:

6 5 18 12

Sample Output:

3036

#include <cstdlib>#include <iostream>#include <algorithm>using namespace std;int main(int argc, char *argv[]){    unsigned int n1, n2;        while(cin >> n1 >> n2)    {        int temp1 = n1, temp2 = n2;                if(n1 < n2)            swap(n1, n2);                    unsigned int temp = n1 % n2;                while(temp != 0)        {            n1 = n2;            n2 = temp;            temp = n1 % n2;        }                cout << temp1 / n2 * temp2 << endl;        }    return EXIT_SUCCESS;}