L1-009 N个数求和 (20 分)
本题的要求很简单,就是求N
个数字的和。麻烦的是,这些数字是以有理数分子/分母
的形式给出的,你输出的和也必须是有理数的形式。
输入格式:
输入第一行给出一个正整数N
(≤100)。随后一行按格式a1/b1 a2/b2 ...
给出N
个有理数。题目保证所有分子和分母都在长整型范围内。另外,负数的符号一定出现在分子前面。
输出格式:
输出上述数字和的最简形式 —— 即将结果写成整数部分 分数部分
,其中分数部分写成分子/分母
,要求分子小于分母,且它们没有公因子。如果结果的整数部分为0,则只输出分数部分。
输入样例1:
5
2/5 4/15 1/30 -2/60 8/3
输出样例1:
3 1/3
输入样例2:
2
4/3 2/3
输出样例2:
2
输入样例3:
3
1/3 -1/6 1/8
输出样例3:
7/24
#include <iostream>
#include <stdlib.h>
using namespace std;
long long sumNumRator = 0;
long long sumDenoMinator = 0;
long long gcd(long long a, long b);
long long gcd(long long a, long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
void Sum(long long numRator, long long denoMinator);
void Sum(long long numRator, long long denoMinator) {
//求最小公倍数
long long comDivi, comMul;
comDivi = gcd(denoMinator, sumDenoMinator);
comMul = (max(denoMinator, sumDenoMinator) / comDivi) * min(denoMinator, sumDenoMinator);
//通分(最小公倍数 /分母)
sumNumRator = sumNumRator * (comMul / sumDenoMinator);
numRator = numRator * (comMul / denoMinator);
//分子相加减
sumNumRator += numRator;
//变分母
sumDenoMinator = comMul;
//约分
comDivi = gcd(sumNumRator, sumDenoMinator);
if (sumNumRator != 0) {
sumNumRator = sumNumRator / comDivi;
sumDenoMinator = sumDenoMinator / comDivi;
}
}
int main(int argc, char* argv[]) {
int n;
string s;
string numeRator, denoMinator;
long long comDivi;
cin >> n >> s;
numeRator = s.substr(0, s.find('/'));
denoMinator = s.substr(s.find('/') + 1, s.length() - 1);
sumNumRator = atoi(numeRator.c_str());
sumDenoMinator = atoi(denoMinator.c_str());
for (int i = 1; i < n; i++) {
cin >> s;
numeRator = s.substr(0, s.find('/'));
denoMinator = s.substr(s.find('/') + 1, s.length() - 1);
Sum(atoi(numeRator.c_str()), atoi(denoMinator.c_str()));
}
//化简
if (sumNumRator > sumDenoMinator && (sumNumRator % sumDenoMinator != 0) ) { //分子大于分母
long long sum = sumNumRator / sumDenoMinator;
sumNumRator %= sumDenoMinator;
cout << sum << " ";
if (sumNumRator != 0) {
//求最大公约数
comDivi = gcd(sumNumRator, sumDenoMinator);
cout << (sumNumRator / comDivi) << "/" << (sumDenoMinator / comDivi) << endl;
}
}
else if (sumNumRator % sumDenoMinator == 0) { //分子等于分母
cout << (sumNumRator / sumDenoMinator) << endl;
}
else { //分子小于分母
if (sumNumRator != 0) {
//求最大公约数
comDivi = gcd(sumNumRator, sumDenoMinator);
cout << (sumNumRator / comDivi) << "/" << (sumDenoMinator / comDivi) << endl;
}
else cout << "0" << endl;
}
return 0;
}