【笨方法学PAT】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

二、题目大意

给N个有理数（以分子/分母的形式给出），计算这N个数的总和，最后总和要以（整数 分子/分母）的形式给出

三、考点

基本数学

四、注意

1、求最大公约数的时候使用辗转相除法；

2、在读取的时候就累加并化简；

3、最后再化成整数 分子/分母的形式。

五、代码

#include<iostream>
#include<algorithm>
using namespace std;
int gcd(int a, int b) {
	return b == 0 ? a : gcd(b,a%b);
}
int main() {
	//read
	int n;
	cin >> n;

	//solve while read
	int a=0, b=1;
	while (n--) {
		int c,d;
		scanf("%d/%d", &c, &d);
		a = a*d + b*c;
		b = b*d;
		int t = gcd(a, b);
		a /= t, b /= t;
	}

	//output
	if (a*b < 0) {
		cout << "-";
		a = abs(a), b = abs(b);
	}
	if (a == 0) {
		cout << 0;
		return 0;
	}
	if (a / b != 0) {
		cout << a / b;
		if (a%b != 0) 
			cout << " " << a%b << "/" << b;
	}
	else
		cout << a << "/" << b;

	system("pause");
	return 0;
}