【发布时间】:2015-12-16 09:54:32
【问题描述】:
#include <stdio.h>
int gcd(int a, int b);
int lcm(int x ,int y);
int main()
{
int num1, num2, k, hcf,max,n;
scanf("%d",n);
for (k=0;k<n;k++)
{
scanf("%d %d", &num1, &num2);
hcf=gcd(num1,num2);
max=lcm(num1,num2);
printf("%d %d\n", hcf,max);
}
return 0;
}
int gcd(int a, int b)
{
int i,f;
for(i=1;i<=a || i<=b; i++)
if (a%i==0 && b%i==0)
f=i;
return f;
}
int lcm(int x ,int y)
{
int m;
m=(x>y) ? x : y;
while(1)
{
if(m%x==0 && m%y==0)
{
return m;
break;
}
++m;
}
return x,y;
}
【问题讨论】:
标签: c greatest-common-divisor cc lcm