/*
* 约分.c
*
* Created on: 2016年11月17日
* Author: PC
*/
#include <stdio.h>
int cal_gcd(int m,int n);
int main(void)
{
int denom,num,remainder;
* 约分.c
*
* Created on: 2016年11月17日
* Author: PC
*/
#include <stdio.h>
int cal_gcd(int m,int n);
int main(void)
{
int denom,num,remainder;
scanf("%d/%d",&num,&denom);
remainder=cal_gcd(num,denom);
num /=remainder;
denom /=remainder;
printf("In lowest term:%d/%d",num,denom);
return 0;
}
remainder=cal_gcd(num,denom);
num /=remainder;
denom /=remainder;
printf("In lowest term:%d/%d",num,denom);
return 0;
}
int cal_gcd(int m,int n)
{
int remainder;
{
int remainder;
if(n<0)
n=-n;
if(m<0)
m=-m;
n=-n;
if(m<0)
m=-m;
while(n!=0)
{
remainder=m%n;
m=n;
n=remainder;
}
return m;
}
{
remainder=m%n;
m=n;
n=remainder;
}
return m;
}