题目一

题目：Given N rational numbers in the form “numerator/denominator”, you are supposed to calculate their sum.

我的代码：

链接：https://www.nowcoder.com/questionTerminal/3f9db00a3df04816ae87c370c24ee14c?toCommentId=5382974
来源：牛客网

#include<iostream>
using namespace std;
 
//辗转相除法求最大公约数
int gcd(int x,int y){
    int z;
    while(y){
        z = x % y;
        x = y;
        y = z;
    }
    return abs(x);  //这里做了特殊处理，返回绝对值，因为公约数有可能是负数
}
 
int main(){
    long a[2] = {0},b[2] = {0};
    int n,gb;
    cin>>n;
    scanf("%ld/%ld",&a[1],&b[1]);
    for(int i = 1;i < n;i++){
        scanf("%ld/%ld",&a[0],&b[0]);
        a[1] = a[0] * b[1] + a[1] * b[0];
        b[1] = b[0] * b[1];
    }
    //先化为最简
    gb = gcd(a[1],b[1]); 
    a[1] /= gb; b[1] /= gb;
     
    //输出
    if(a[1] == 0) cout<<0;
    else if(a[1]/b[1] != 0 && a[1]%b[1] != 0){
        cout<<a[1]/b[1]<<' '<<a[1]%b[1]<<'/'<<b[1];
    }
    else if(a[1]/b[1] != 0) cout<< a[1]/b[1];
    else if(a[1] % b[1] != 0) cout<< a[1]%b[1]<<'/'<<b[1];
}