PAT--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

题解

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
struct Fraction{
    LL fz, fm;
};

LL gcd(LL a, LL b){
    return b == 0 ? a : gcd(b, a % b);
}

Fraction simplify(Fraction A){
    int g = gcd(A.fz, A.fm);
    return Fraction{A.fz / g, A.fm / g};
}

Fraction operator + (Fraction A, Fraction B){
    A = simplify(A), B = simplify(B);
    LL fz = A.fz * B.fm + A.fm * B.fz;
    LL fm = A.fm * B.fm;
    int g = gcd(fz, fm);
    return Fraction{fz / g, fm / g};
}

int n;
vector<Fraction> f;

int main(){
#ifndef ONLINE_JUDGE
freopen("data.in", "r", stdin);
#endif // ONLINE_JUDGE

    cin >> n;
    for(int i = 0; i < n; ++i){
        int a, b; scanf("%d/%d", &a, &b);
        f.push_back(Fraction{a, b});
    }

    Fraction ans = f[0];
    for(int i = 1; i < f.size(); ++i){
        ans = ans + f[i];
    }

    if(ans.fz % ans.fm == 0){
        cout << ans.fz / ans.fm << endl;
    }else if(abs(ans.fz) > abs(ans.fm)){
        LL integer = ans.fz / ans.fm;
        ans.fz %= ans.fm;
        if(ans.fm < 0){
            ans.fz = -ans.fz;
            ans.fm = -ans.fm;
        }
        printf("%lld %lld/%lld\n", integer, ans.fz, ans.fm);
    }else{
        printf("%lld/%lld\n", ans.fz, ans.fm);
    }


    return 0;
}