1081 Rational Sum (20分)

最新推荐文章于 2021-03-02 19:42:18 发布

四郎别认输

最新推荐文章于 2021-03-02 19:42:18 发布

阅读量99

点赞数

分类专栏：算法文章标签：算法 leetcode pat

本文链接：https://blog.csdn.net/qq_43287952/article/details/113193816

版权

算法专栏收录该内容

59 篇文章 2 订阅

订阅专栏

Given N rational numbers in the form numerator/denominator, you are supposed to calculate their sum.

Input Specification:

Each input file contains one test case. Each case starts with a positive integer N (≤100), followed in the next line N rational numbers a1/b1 a2/b2 ... where all the numerators and denominators are in the range of long int. If there is a negative number, then the sign must appear in front of the numerator.

Output Specification:

For each test case, output the sum in the simplest form integer numerator/denominator where integer is the integer part of the sum, numerator < denominator, and the numerator and the denominator have no common factor. You must output only the fractional part if the integer part is 0.

Sample Input 1:

5
2/5 4/15 1/30 -2/60 8/3

Sample Output 1:

3 1/3

Sample Input 2:

2
4/3 2/3

Sample Output 2:

Sample Input 3:

3
1/3 -1/6 1/8

Sample Output 3:

7/24

#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <sstream>
#include <string.h>

using namespace std;

struct Fraction
{
    int up=0;
    int down=0;
};


int gcd(int up,int down)
{
    while(down>0)
    {
        int temp = down;
        down = up%down;
        up=temp;
    }
    return up;
}

Fraction reduction(Fraction result)
{
    if(result.down<0)
    {
        result.up=-result.up;
        result.down=-result.down;
    }
    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)
{
    f1=reduction(f1);
    f2=reduction(f2);
    Fraction result;
    result.down = f1.down*f2.down;
    result.up = f1.up*f2.down+f2.up*f1.down;
    return reduction(result);
}

void show(Fraction fraction)
{
    if(fraction.up<fraction.down)
    {
        cout<<fraction.up;
        if(fraction.up!=0)
        {
            cout<<"/"<<fraction.down;
        }
    }
    else
    {
        int n = fraction.up/fraction.down;
        cout<<n;
        n=fraction.up%fraction.down;
        if(n>0)
            cout<<" "<<n<<"/"<<fraction.down;
    }

}

Fraction fractions[110];
int main()
{
    int n;
    cin>>n;
    for(int i=0; i<n; i++)
    {
        scanf("%d/%d",&fractions[i].up,&fractions[i].down);
    }
    Fraction ff;
    for(int i=0; i<n; i++)
    {
        ff=add(ff,fractions[i]);
    }
    show(ff);
    return 0;
}