|gcd分子相加|7-1 N个数求和 (20分)

struct Fraction{
    ll up,down;
};

//gcd
ll gcd(ll a,ll b){
//     ll c;
//     while(a%b!=0){
//         c=a%b;
//         a=b;
//         b=c;
//     }
//     return c;
    return b==0?a:gcd(b,a%b);
}


    sum.up=0;
    sum.down=1;
    for(int i=0;i<n;i++){
        scanf("%lld/%lld",&temp.up,&temp.down);
        sum=add(sum,temp);
    }

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);//返回分子和分母的数字，还没有化简
}


Fraction reduction(Fraction result){//化简分数--分母为负数---分子为0
    if(result.down<0){//分母为负数--->分子换符号，保证分母为正
        result.up=-result.up;
        result.down=-result.down;
    }
    if(result.up==0){//分子为0
        result.down=1;///分母为1
    }else{
        int d=gcd(abs(result.up),abs(result.down));
        result.up/=d;
        result.down/=d;
    }
    return result;
}


 showResult(sum);

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

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
struct Fraction{
    long long up,down;
};

ll gcd(ll a,ll b){
//     ll c;
//     while(a%b!=0){
//         c=a%b;
//         a=b;
//         b=c;
//     }
//     return c;
    return b==0?a:gcd(b,a%b);
}

Fraction reduction(Fraction result){//化简分数--分母为负数---分子为0
    if(result.down<0){//分母为负数--->分子换符号，保证分母为正
        result.up=-result.up;
        result.down=-result.down;
    }
    if(result.up==0){//分子为0
        result.down=1;///分母为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);
    return 0;
}