1081 Rational Sum

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

AC代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath> 
using namespace std;
typedef long long ll;

void change(string str, ll &n, ll &d){ //获得分子与分母
	int i = 0;
	if(str[i] == '-') i = 1;
	while(str[i] != '/'){
		n = n * 10 + str[i] - '0';
		i++;
	}
	if(str[0] == '-') n = -n;
	for(++i; i < str.size(); i++)
		d = d * 10 + str[i] - '0';
}

ll gcd(ll a, ll b){
	return !b ? a : gcd(b, a % b);
}

void add(ll &n1, ll &d1, ll n2, ll d2){
	n1 = n1 * d2 + n2 * d1;
	d1 = d1 * d2;
	ll c = gcd(abs(n1), d1);
	d1 /= c;
	n1 /= c;
}

int main(){ 
	int m;
	string str;
	ll n1 = 0, d1 = 0;
	cin>>m>>str;
	change(str, n1, d1);
	for(int i = 1; i < m; i++){
		ll n2 = 0, d2 = 0;
		cin>>str;
		change(str, n2, d2);
		add(n1, d1, n2, d2);
		//cout<<n1<<" "<<d1<<endl;

	}
	int integer = n1 / d1;
	n1 = n1 % d1;
	if(n1 == 0 && integer == 0) cout<<"0";
	if(integer){
		cout<<integer;
		if(n1) cout<<" ";
	} 
	if(n1) cout<<n1<<"/"<<d1;
	return 0;
}