1081 Rational Sum (20分)--PAT甲级真题

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

#include<iostream>
int gcd(long long int a, long long int b){
	if (b == 0) 
		return a; 
	else 
		return gcd(b, a%b); 
} 
long long int lcm(long long int a, long long int b){
	return a * b / gcd(a, b);
} 
struct Rational{
	long long int i = 0,nume = 0,den = 1;
	void formal() {
		i += nume / den;
		nume = nume % den;
		long long int GCD = gcd(nume, den);
		nume /= GCD;
		den /= GCD;
	}
	Rational add(Rational& B) {
		formal();
		B.formal();
		i += B.i;
		nume = nume * B.den + B.nume*den;
		den = den * B.den;
		formal(); 
		return *this;
	}
};
int main(){
	int n;
	scanf("%d", &n);
	Rational ret;
	for (int i = 0; i < n; i++){
		Rational tmp;
		scanf("%lld/%lld", &tmp.nume, &tmp.den);
		ret.add(tmp);
	} 
	if (ret.i != 0 && ret.nume != 0)
		printf("%lld %lld/%lld", ret.i, ret.nume, ret.den);
	else if (ret.i != 0)
		printf("%lld", ret.i);
	else if (ret.nume != 0)
		printf("%lld/%lld", ret.nume, ret.den);
	else
		printf("0");
	return 0;
}