A1081 Rational Sum （20 分）（求N个分数的和）（数学问题）

Given N rational numbers in the form numerator/denominator, you are supposed to calculate their sum.

本题类似题为 B1034/A1088 有理数四则运算：两个分数的加减乘除运算

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 个分数，求分数的和。分数前面可能有负号。若答案为假分数，则按照带分数形式输出；整数按照整数输出；否则按照真分数输出。

思路：

本题是典型的分数计算问题，难度不高，就是较为复杂，需要理解记忆。

多个分数相加，先定义sum，赋初值为 0/1, sum = add(sum, temp); 不断连加即可得到总和

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){   //求a与b的最大公约数
  if(b == 0)
    return a;
  else
    return 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){
    result.down = 1;
  }
  else{
    int d = gcd(abs(result.up), abs(result.down));
    result.up /= d;
    result.down /= d;
  }
  return result;
}
Fraction add(Fraction f1, Fraction 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){
  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;
  for(int i = 0; i < n; i++){
    scanf("%lld/%lld", &temp.up, &temp.down);
    sum = add(sum, temp);
  }
  showResult(sum);
  return 0;
}