1081 Rational Sum (20分)

#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long LL;
struct rational{
	long long c,m;
};
LL gcd(LL a, LL b){
	if(b==0) return a;
	else gcd(b,a%b);
}
LL gys(LL a, LL b){
	LL c = gcd(a,b);
	LL ans = (a*b)/c;
	return ans;
}
rational beEasy(rational a)
{
	LL t = gcd(abs(a.c),a.m);
	a.c /= t;
	a.m /= t;
	return a;
}
rational add(rational a, rational b)
{
	a = beEasy(a);
	b = beEasy(b);
	rational c;
	c.m = a.m*b.m;
	c.c = a.c*b.m+b.c*a.m;
	c = beEasy(c);
	return c;
 } 
int main()
{	
	int n;
	scanf("%d",&n);
	rational ans,tmp;
	scanf("%lld/%lld",&ans.c,&ans.m);
	for(int i=1; i<n; i++){
		scanf("%lld/%lld",&tmp.c,&tmp.m);
		ans=add(ans,tmp);
	}
	if(ans.c<0) printf("-");
	ans.c = abs(ans.c);
	if(ans.c/ans.m!=0)printf("%lld",ans.c/ans.m);
	if(ans.c/ans.m==0&&ans.c%ans.m!=0)printf("%lld/%lld",ans.c%ans.m,
	ans.m);
	else if(ans.c/ans.m!=0&&ans.c%ans.m!=0){
		printf(" %lld/%lld",ans.c%ans.m,
	ans.m);
	}
	else if(ans.c/ans.m==0&&ans.c%ans.m==0){
		printf("0");
	}
	return 0;	
}