PATA1081_模拟分数运算（难度：⭐️⭐️⭐️）

分享两个测试点：
1、-3/3

2、-0/3

如果对每次加的结果不立即化简的话，最后一个测试点会浮点错误，应该是分子和超long long了

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

struct node {
    int itg;
    ll up, down;
};
ll gcd (ll a, ll b) {
    return a % b == 0 ? b : gcd (b, a % b);
}
vector<node> v;
void init (node &a) {
    if (a.up > 0 && a.down < 0) {
        a.up *= -1;
        a.down *= -1;
    }
    if (a.up < 0 && a.down < 0) {
        a.up = abs(a.up);
        a.down = abs(a.down);
    }
    ll t = gcd (abs(a.up), abs(a.down));
    a.up = a.up / t;
    a.down = a.down / t;
}
node sum () {
    node pre = v[0];
    for (int i = 1; i < v.size(); i++) {
        pre.up = pre.up * v[i].down + pre.down * v[i].up;
        pre.down = pre.down * v[i].down;
        init(pre);
    }
    return pre;
}
int main() {
    int n;
    node temp;
    scanf ("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf ("%lld/%lld", &temp.up, &temp.down);
        init(temp);
        v.push_back(temp);
    }
    node ans = sum();
    if (abs(ans.up) >= ans.down || ans.up == 0) {
        printf ("%lld", ans.up / ans.down);
        if (abs(ans.up % ans.down != 0)) printf (" %lld/%lld", abs(ans.up % ans.down), ans.down);
    }
    else printf ("%lld/%lld", ans.up % ans.down, ans.down);
}