当前位置：网站首页>代码—

代码—

2022-07-22 09:24:00 【沙子是沙子】

#include<stdio.h>
int cal_gcd(int m,int n);
int main(void)
{
int num,denom,remainder;
printf("Enter a fraction: ");
setvbuf(stdout,NULL,_IONBF,0);
scanf("%d/%d",&num,&denom);
remainder=cal_gcd(num,denom);
num/=remainder;
denom/=remainder;
printf("In lowest terms:%d/%d\n",num,denom);
return 0;
}

int cal_gcd(int m,int n)
{
int well;
while(n!=0)
{
well=m % n;
m=n;
n=well;
}
if(m<0)
{
n*=-1;
m*=-1;
}
return m;
}

原网站

版权声明
本文为[沙子是沙子]所创，转载请带上原文链接，感谢
https://blog.csdn.net/shazi4399/article/details/53695870