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 N rational 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

---

思路

初始和分子0，分母1
每次输入一个分数就与和相加
加完之后再约分
最后根据不同格式输出

---

代码

#include<cstdio>
#include<cmath>
long long gcd(long long a,long long b){//分母是用正数进行的 
	return a%b==0?b:gcd(b,a%b);
}
int main(){
	int n;
	long long suma=0,sumb=1,a,b,gcdvalue;
	scanf("%lld",&n);
	//得到加法后的结果 
	for(int i=0;i<n;i++){
		scanf("%lld/%lld",&a,&b);
		//没输入一个分数，就与之前的和相加 
		suma=suma*b+sumb*a;
		sumb*=b;
		//约分 
		gcdvalue=gcd(abs(suma),abs(sumb));
		suma=suma/gcdvalue;
		sumb=sumb/gcdvalue; 
	}
	if(suma%sumb==0){
		long long t=suma/sumb;
		printf("%lld\n",t);
	}else{
		if(suma>sumb){
			long long t=suma/sumb;
			printf("%lld ",t);
			printf("%lld/%lld\n",suma-t*sumb,sumb);
		}else{
			printf("%lld/%lld\n",suma,sumb);
		}
	}
	
	return 0;
}