GCD and LCM
Description
Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b (0 < a, b ≤ 44000).
Input
The first line of input gives the number of cases, N(1 ≤ N ≤ 100). N test cases follow.
Each test case contains two interger a and b separated by a single space in a line.
Output
For each test case, print GCD and LCM separated by a single space in a line.
Sample Input
2
8 6
5000 3000
Sample Output
2 24
1000 15000
#include<stdio.h>
int getgcd(int a,int b)
{
int gcd;
int t1,t2;
t1=a;
t2=b;
gcd=t1%t2;
while(gcd!=0)
{
t1=t2;
t2=gcd;
gcd=t1%t2;
}
return t2;
}
int main()
{
int n;
int a,b;
while(scanf("%d",&n)!=EOF)
{
while(n--)
{
scanf("%d%d",&a,&b);
printf("%d %d\n",getgcd(a,b),a*b/(getgcd(a,b)));
}
}
return 0;
}
*****************************************************************************************************************华丽丽的分割线:
求最大公约数采用的是递归函数的方法…
等最大公约数求解出来之后,就可以很容易的解出最小公倍数了
有两种方法可以求解最小公倍数,第一种是用ag/b,但我自己在调试的时候发现,会出现溢出的情况,所以在采用了第二种方法之后,会好用的多,就是用a/gb,这样就不会存在溢出的问题了……·……