题目大意:
题目大意:
给出n个分数,求分数的和,分数前面可能有负号。
如果答案为假分数,则要按照带分数的形式输出,整数则按整数输出,否则按真分数输出。
思路:
常规的分数四则运算。参考[算法笔记]数学问题
注意每一步都要约分,计算最大公约数时使用绝对值。
使用long long 类型,使用int会分母相乘会溢出。
AC代码:
//PAT_A 1078
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
struct Fraction{
ll up, down;
};
ll gcd(ll a, ll b) {
if (b == 0)return a;
else return gcd(b, a % b);
}
Fraction reduction(Fraction result) {
if (result.down < 0) {
result.up *= -1;
result.down *= -1;
}
if (result.up == 0)result.down = 1;
else {
int d = gcd(result.up, result.down);
result.up /= d;
result.down /= d;
}
return result;
}
Fraction add(Fraction a, Fraction b) {
Fraction result;
result.up = a.up * b.down + a.down * b.up;
result.down = a.down * b.down;
return reduction(result);
}
void show(Fraction result) {
if (result.down == 1)printf("%lld", result.up);
else if (abs(result.up) > result.down) {
printf("%lld %lld/%lld\n", result.up / result.down, abs(result.up) % result.down, result.down);
}
else printf("%lld/%lld", result.up, result.down);
}
int main() {
int n;
(void)scanf("%d", &n);
Fraction sum{ 0,1 }, temp;
for (int i = 0; i < n; i++) {
(void)scanf("%lld/%lld", &temp.up, &temp.down);
sum = add(temp, sum);
}
show(sum);
return 0;
}