L1-009 N个数求和

#include <bits/stdc++.h>
using namespace std;
typedef long int ll;
const int N = 1e5 + 10;
void gcd(ll &a, ll &b)
{
    ll g = __gcd(a, b);
    a /= g;
    b /= g;
}

void solve()
{
    int n;
    int long a, b, x, y;
    cin >> n;
    char q;
    cin>>a>>q>>b;
    for (int i = 1; i < n; i++)
    {
        cin>>x>>q>>y;
        a = a * y + x * b;
        b = b * y;
        gcd(a, b);
    }
    if (a % b == 0)
        cout << a / b << endl;
    else
    {
        if (a / b)
            cout << a / b << ' ' <<abs( a - a / b*b) << '/' << b << endl;
        else
            cout<<a<<'/'<<b<<endl;
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t--)
    {
        solve();
    }
    return 0;
}