hdu 1108 最小公倍数

http://acm.hdu.edu.cn/showproblem.php?pid=1108 

View Code

 1 #include<iostream>
 2 #include<cmath>
 3 using namespace std;
 4 int gcd(int a1,int b1)//
 5 {
 6     int a=max(a1,b1);
 7     int b=min(a1,b1);
 8     int temp=a%b;
 9     while(temp!=0)
10     {
11        a=b;
12        b=temp;
13        temp=a%b;
14     }
15     return b;
16 }
17 int main()
18 {
19     int a,b;
20     while(cin>>a>>b)
21     {
22        cout<<a*b/gcd(a,b)<<endl;
23     }
24     return 0;
25 }

 

转载于:https://www.cnblogs.com/keepmoving89/archive/2012/04/03/2431077.html