Sixth Grade Math(0109)

最新推荐文章于 2020-02-01 09:58:16 发布

原创最新推荐文章于 2020-02-01 09:58:16 发布 · 534 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

16 篇文章

订阅专栏

本文详细介绍了如何通过输入数据集的数量及每组数据中的两个正整数，来计算每组数据的最小公倍数(LCM)与最大公约数(GCF)，并展示了具体的算法实现过程。

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

Sample Input

10 5
161 1
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;
}