Description
The first line of input contains a single integer N, (1 < = N < = 1000) which is the number of data sets that follow. Each data set consists of a single line of input containing two positive integers, a and b, (1< = a,b < = 1000) separated by a space.
Input
For each data set, you should generate one line of output with the following values: The data set number as a decimal integer (start counting at one), a space, the LCM, a space, and the GCF.
Output
1
2
3
4
|
3
5 10
7 23
42 56
|
Sample Input
1
2
3
|
1 10 5
2 161 1
3 168 1
|
#include<stdio.h>
int LG(int x,int y)
{
int p,q;
p=x*y;
while(y!=0)
{
q=x%y;
x=y;
y=q; //利用辗转相除法得到最大公约数
}
printf("%d %d\n",p/x,x); //两个数的乘积除以最大公约数得到最大公因数(他么上了大学者都忘了!。。。)
return(x,y); //记得给这个函数返回一个值!
}
int main()
{
int N,i;
int a,b;
scanf("%d",&N);
for(i=1;i<=N;i++)
{
scanf("%d %d",&a,&b);
printf("%d ",i);
LG(a,b);
}
return 0;
}