本文介绍了一个简单的C语言程序，该程序能够读取用户输入的分数，并通过计算分子和分母的最大公约数来实现分数的约分。展示了如何使用辗转相除法求最大公约数。
#include <stdio.h>
int kk(int m,int n);
int main (void)
{
int num,denom,remainder;
scanf("%d/%d",&num,&denom);
remainder=kk(num,denom);
num/=remainder;
denom/=remainder;
printf("In lowest term:%d/%d",num,denom);
return 0;
}
int kk(int m,int n)
{
int remainder;
if(n<0)
n=-n;
if(m<0)
m=-m;
while(n!=0){
remainder=m%n;
m=n;
n=remainder;
}
return m;
}
int kk(int m,int n);
int main (void)
{
int num,denom,remainder;
scanf("%d/%d",&num,&denom);
remainder=kk(num,denom);
num/=remainder;
denom/=remainder;
printf("In lowest term:%d/%d",num,denom);
return 0;
}
int kk(int m,int n)
{
int remainder;
if(n<0)
n=-n;
if(m<0)
m=-m;
while(n!=0){
remainder=m%n;
m=n;
n=remainder;
}
return m;
}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
