【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

题意：有理数求和

思路：求最小公倍数，约分求和。 注意爆long long 和为0的情况

代码：

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define drep(i,n,a) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a,n,sizeof(a))
#define lowbit(i) ((i)&(-i))
typedef long long ll;
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const double eps = 1e-6;
const int N = 1e4+5;

template <class T>
T gcd(T a,T b) {
    return b?gcd(b,a%b):a;
}
int main() {
    ll n,a,b;
    ll fenzi=0,fenmu=1;
    scanf("%lld",&n);
    while(n--) {
        scanf("%lld/%lld",&a,&b);
        ll gcdVal=gcd(a,b);///先约分，后求和
        a/=gcdVal;
        b/=gcdVal;
        fenzi=a*fenmu+fenzi*b;
        fenmu=fenmu*b;
        gcdVal=gcd(fenzi,fenmu);///约分避免爆long long
        fenzi/=gcdVal;
        fenmu/=gcdVal;
//        printf("%lld  %lld\n",fenzi,fenmu);
    }
    ll integer=fenzi/fenmu;
    fenzi-=(fenmu*integer);
    if(integer) {
        printf("%lld",integer);
        if(fenzi) printf(" ");
    }
    if(fenzi) {
        printf("%lld/%lld",fenzi,fenmu);
    }
    if(!integer&&!fenzi) {
        printf("0");
    }
    return 0;
}