PAT-A1081 Rational Sum

PAT-A1081 Rational Sum

Problem Description:

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

Notice:

1. 数据范围为 int,因此两个分母相乘时，最大可以达到 long long，所以如果使用 int就会溢出，得到“答案错误”。
2. 必须在每一步激发后都进行约分，如果等全部加完后才约分，则会溢出。
3. 计算最大公约数时，要注意是计算分子分母绝对值的公约数，否则下面的数据会出错误。

Code:

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;			//记ll为long long
ll gcd(ll a, ll b)	{			//求a与b的最大公约数
	return b == 0 ? a : gcd(b, a % b); 
} 
struct Fraction {				//分数
	ll up, down;				//分子、分母 
};
Fraction reduction(Fraction result)	{			//化简
	if(result.down < 0)	{			//分母为负数，令分子和分母都变为相反数
		result.up = -result.up;
		result.down = -result.down; 
	} 
	if (result.up == 0)	{					//如果分子为0
		result.down = 1;					//令分母为1 
	} else {					//如果分子不为0，进行约分
		int d = gcd(abs(result.up), abs(result.down));				//分子分母的最大公约数
		result.up /= d;								//约去最大公约数
		result.down /= d; 
	} 
	return result;
}
Fraction add(Fraction f1, Fraction f2)	{			//分数f1加上f2
	Fraction result;
	result.up = f1.up * f2.down + f2.up * f1.down;			//分数和的分子
	result.down = f1.down * f2.down;					//分数和的分母
	return reduction(result);							//返回结果分数，注意化简 
}
void showResult(Fraction r)	{							//输出分数r
	reduction(r);
	if(r.down == 1)	printf("%lld\n", r.up);				//整数
	else if(abs(r.up) > r.down)	{						//假分数
		printf("%lld %lld/%lld\n", r.up / r.down, abs(r.up) % r.down, r.down); 
	} else {											//真分数
		printf("%lld/%lld\n", r.up, r.down); 
	}
} 
int main()	{
	int n;				
	scanf("%d", &n);									//分数个数
	Fraction sum, temp;
	sum.up = 0; sum.down = 1;							//和的分子为0，分为为1
	for(int i = 0; i < n; i++)	{		
		scanf("%lld/%lld", &temp.up, &temp.down);
		sum = add(sum, temp);							//sum增加temp 
	}
	showResult(sum);									//输出结果
	return 0; 
}