#include<stdio.h>
void mygcd(int m, int n); //*这里的最大公约数函数我设置成了直接对两个数作用,使他们成为最简形式*//
int main() {
int a,b,c,d,e,f,T;
scanf("%d", &T);
scanf("%d/%d", &a, &b);
while(--T){
scanf("%d/%d", &c, &d);
e = a*d + b*c;
f = b*d;
a = e;
b = f;
}
mygcd(a,b);
return 0;
}
void mygcd(int m1, int n1){
int t;
int m = m1;
int n = n1;
while(1){
if(n > m){
t = m;
m = n;
n = t;
}
else{
t = m % n;
if(t == 0)
break;
m = n;
n = t;
}
}
m1 /= n;
n1 /= n;
printf("%d/%d",m1,n1 );
}
一个不够智能的分数计算器
最新推荐文章于 2024-07-18 11:11:00 发布