#include <stdio.h>
int divisor,denominator;
int fun1(int x,int y)
{
if(x<y)
{
x+=y;
y=x-y;
x=x-y;
}
if(x%y)
divisor=fun1(y,x%y);
else
return divisor=y;
}
void fun2(int x,int y)
{
denominator = x*y/divisor;
}
int main()
{
int a,b;
printf("Pleaes enter two numbers:");
scanf("%d %d",&a,&b);
fun1(a,b);
fun2(a,b);
printf("The greatest common divisor is:%d \n",divisor);
printf("The minimum common denominator is :%d\n",denominator);
}
辗转相除法求最大共约数和最小公倍数
最新推荐文章于 2022-05-19 16:37:52 发布