PAT 1081. Rational Sum(20)

最新推荐文章于 2022-07-06 02:32:36 发布

uiuiui_what

最新推荐文章于 2022-07-06 02:32:36 发布

阅读量409

点赞数

分类专栏：原创 PAT

本文链接：https://blog.csdn.net/u012443276/article/details/40144065

版权

原创同时被 2 个专栏收录

38 篇文章 0 订阅

订阅专栏

PAT

37 篇文章 0 订阅

订阅专栏

#include<iostream>
using namespace std;
int n;
long a1, b1, a2, b2;
long gcd(long a, long b){
 if (b < 0) b = -b;
 while (b != 0){
  long k = a%b;
  a = b;
  b = k;
 }
 return a;
}
int main(){
 cin >> n;
 char ch;
 cin >> a1 >> ch >> b1;
 for (int i = 1; i < n; i++){
  cin >> a2 >> ch >> b2;
  long long fenmu = b1*b2;
  long long fenzi = a1*b2 + a2*b1;
  long d = gcd(fenmu, fenzi);
  b1 = fenmu / d;
  a1 = fenzi / d;
 }
 bool first = true;
 if (a1 / b1){
  cout << a1 / b1; 
  first = false;
  a1 %= b1;
 }
 else if (!(a1%b1)) cout << a1;
 if (a1){
  if (!first)
   cout << " ";
  if (a1 < 0) a1 = -a1;
  cout << a1 << "/" << b1;
 }
  
}