天梯练习 7-9 N个数求和

ailo11111

于 2022-04-22 17:40:41 发布

阅读量148

点赞数

分类专栏：天梯赛文章标签： c++

本文链接：https://blog.csdn.net/m0_45400399/article/details/124347883

版权

C++ 有理数加法最大公约数约分

关键词由CSDN通过智能技术生成

天梯赛专栏收录该内容

15 篇文章 0 订阅

订阅专栏

#include<iostream>

using namespace std;

typedef long long LL;

LL gcd(LL a, LL b)
{
	return b ? gcd(b, a % b) : a;
}
int main()
{
	LL N = 0, a = 0, b = 0, sum_a = 0, sum_b = 1, t;
	scanf("%lld", &N);
	for (int i = 0; i < N; i++)
	{
		scanf("%lld/%lld", &a, &b);
		//通分
		sum_a *= b;
		sum_a += a * sum_b;
		sum_b *= b;
        
		//约分
		t = gcd(sum_a, sum_b);
		sum_a /= t;
		sum_b /= t;
        
	}
    
	if (sum_a % sum_b == 0)
		printf("%lld\n", sum_a / sum_b);
	else if (sum_a < sum_b)
		printf("%lld/%lld\n", sum_a, sum_b);
	else
		printf("%lld %lld/%lld\n", sum_a / sum_b, sum_a % sum_b, sum_b);
    
	return 0;
}