hdu 1108

最小公倍数

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22738    Accepted Submission(s): 12338

Problem Description

给定两个正整数，计算这两个数的最小公倍数。

 

Input

输入包含多组测试数据，每组只有一行，包括两个不大于1000的正整数.

 

Output

对于每个测试用例，给出这两个数的最小公倍数，每个实例输出一行。

 

Sample Input

10 14

 

Sample Output

70

 

Source

POJ

 

Recommend

Eddy

 

#include <iostream>using namespace std;int GCD(int a, int b){int temp;if(a < b){temp = a;a = b;b = temp;}if (a%b == 0)return b;else return GCD(b, a%b);}int LCM(int a, int b){return a/GCD(a, b)*b;}int main(){int a, b;while (cin>>a>>b){cout<<LCM(a, b)<<endl;}return 0;}