1081 Rational Sum（20 分）

Given N rational numbers in the form numerator/denominator, you are supposed to calculate their sum.

Input Specification:

Each input file contains one test case. Each case starts with a positive integer N (≤100), followed in the next line Nrational numbers a1/b1 a2/b2 ... where all the numerators and denominators are in the range of long int. If there is a negative number, then the sign must appear in front of the numerator.

Output Specification:

For each test case, output the sum in the simplest form integer numerator/denominator where integer is the integer part of the sum, numerator < denominator, and the numerator and the denominator have no common factor. You must output only the fractional part if the integer part is 0.

Sample Input 1:

5
2/5 4/15 1/30 -2/60 8/3

Sample Output 1:

3 1/3

Sample Input 2:

2
4/3 2/3

Sample Output 2:

2

Sample Input 3:

3
1/3 -1/6 1/8

Sample Output 3:

7/24

 

#include<iostream>
#include<math.h>
#include<string>
using namespace std;
int maxy(int a,int b){
	if(b==0)
		return a;
	else maxy(b,a%b);
}


int main() {
	//while (1) {
		int n;
		cin>>n;
		long long suma=0,sumb=1,yue;
		while(n--){
			long long a,b;
			scanf("%lld/%lld",&a,&b);
			//cout<<a<<"  "<<b<<endl;
			yue=maxy(a,b);
			a=a/yue;
			b/=yue;
			suma=suma*b+a*sumb;
			sumb=sumb*b;
			yue=maxy(suma,sumb);
			suma/=yue;
			sumb/=yue;
			//cout<<"suma="<<suma<<",sumb="<<sumb<<endl;
		}
		if(suma==0)
			printf("0");
		else{
			long long inte;
			inte=suma/sumb;
			suma=suma%sumb;
			if(inte!=0){
				if(suma!=0)
					printf("%lld %lld/%lld",inte,suma,sumb);
				else
					printf("%lld",inte);
			}else{
				printf("%lld/%lld",suma,sumb);
			}

		}
	//}
}