1081 Rational Sum (20 分)

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

#define ll long long
ll gcd(ll a,ll b)
{
    if(b==0) return a;
    return gcd(b,a%b);
}
struct fraction
{
    ll up,down;
};

fraction reduction(fraction result)
{
    if(result.down<0)
    {
        result.up=-result.down;
        result.down=-result.up;
    }

    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);

}