A1081 Rational Sum (20分)【C语言】

A1081 Rational Sum (20分)【C语言】

原题链接

分数加法（按晴神的套路）

题目描述：
Given N rational numbers in the form numerator/denominator, you are supposed to calculate their sum.

输入格式：
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.

输出格式：
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.

输入样例1：

5
2/5 4/15 1/30 -2/60 8/3

输出样例1：

3 1/3

输入样例2：

2
4/3 2/3

输出样例2：

2

输入样例3：

3
1/3 -1/6 1/8

输出样例3：

7/24

实现代码：

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

ll gcd(ll a, ll b){
   
	return b=&