Sixth Grade Math(0109)

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;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值