PAT 1081 Rational Sum

最新推荐文章于 2024-08-21 18:16:36 发布

菜就要多练

最新推荐文章于 2024-08-21 18:16:36 发布

阅读量184

点赞数

分类专栏： pat甲级文章标签： c++

本文链接：https://blog.csdn.net/weixin_50679551/article/details/127196354

版权

pat甲级专栏收录该内容

123 篇文章 0 订阅

订阅专栏

1081 Rational Sum

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>
using namespace std;

int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}

int main(){
    int a1,b1,a2,b2,n;
    scanf("%d %d/%d",&n,&a1,&b1);
    n--;
    while(n--){
        int b=b1;
        scanf("%d/%d",&a2,&b2);
        a1*=b2,b1*=b2;
        a2*=b,b2*=b;
        int m=gcd(a1+a2,b1);
        a1=(a1+a2)/m;
        b1=b1/m;
    }
    if(a1%b1 && a1/b1)   printf("%d %d/%d\n",a1/b1,a1%b1,b1);
    else if(a1%b1==0)   printf("%d\n",a1/b1);
    else printf("%d/%d\n",a1,b1);
    return 0;
}

好好学习，天天向上！

我要考研！