最小公倍数hdu1108

 1 #include <iostream>
 2 #include <cmath>
 3 #include <cstdio>
 4 using namespace std;
 5 int gcd(int a,int b)
 6 {
 7     return b==0?a:gcd(b,a%b);
 8 }
 9 int main()
10 {
11     int b,a;
12     while(~scanf("%d%d",&a,&b))
13         cout<<a*b/gcd(a,b)<<endl;
14     return 0;
15 }

 

转载于:https://www.cnblogs.com/--lr/p/6921753.html