1034 有理数四则运算

本题要求编写程序，计算 2 个有理数的和、差、积、商。

输入格式：

输入在一行中按照 a1/b1 a2/b2 的格式给出两个分数形式的有理数，其中分子和分母全是整型范围内的整数，负号只可能出现在分子前，分母不为 0。

输出格式：

分别在 4 行中按照 有理数1 运算符 有理数2 = 结果 的格式顺序输出 2 个有理数的和、差、积、商。注意输出的每个有理数必须是该有理数的最简形式 k a/b，其中 k 是整数部分，a/b 是最简分数部分；若为负数，则须加括号；若除法分母为 0，则输出 Inf。题目保证正确的输出中没有超过整型范围的整数。

输入样例 1：

2/3 -4/2

输出样例 1：

2/3 + (-2) = (-1 1/3)
2/3 - (-2) = 2 2/3
2/3 * (-2) = (-1 1/3)
2/3 / (-2) = (-1/3)

输入样例 2：

5/3 0/6

输出样例 2：

1 2/3 + 0 = 1 2/3
1 2/3 - 0 = 1 2/3
1 2/3 * 0 = 0
1 2/3 / 0 = Inf

---

注意事项：

1. int 整形相乘相加，可能会发生溢出；
2. 考虑负负得正的情况！

---

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;

struct rational {
	long long numerator;
	long long denominator;
	long long integer = 0;
	int flag = 1;
};

long long gcd(long long, long long);
void Simplify(rational&a);
void out(rational);

int main()
{
	rational a, b;
	rational sum, difference, product, quotient;
	scanf("%lld/%lld %lld/%lld", &a.numerator, &a.denominator, &b.numerator, &b.denominator);

	sum.numerator = a.numerator*b.denominator + a.denominator*b.numerator;      //可能溢出
	sum.denominator = a.denominator*b.denominator;

	difference.numerator = a.numerator*b.denominator - a.denominator*b.numerator;
	difference.denominator = a.denominator*b.denominator;

	product.numerator = a.numerator*b.numerator;
	product.denominator = a.denominator*b.denominator;

	quotient.numerator = a.numerator*b.denominator;
	quotient.denominator = a.denominator*b.numerator;

	Simplify(a);
	Simplify(b);
	Simplify(sum);
	Simplify(difference);
	Simplify(product);

	out(a); printf(" + "); out(b); printf(" = "); out(sum); printf("\n");
	out(a); printf(" - "); out(b); printf(" = "); out(difference); printf("\n");
	out(a); printf(" * "); out(b); printf(" = "); out(product); printf("\n");

	if (quotient.denominator == 0) {
		out(a); printf(" / "); out(b); printf(" = Inf\n");
		return 0;
	}
	Simplify(quotient);
	out(a); printf(" / "); out(b); printf(" = "); out(quotient); printf("\n");
}

long long gcd(long long M, long long N)
{
	long long tmp;
	while (N > 0) {
		tmp = M % N;
		M = N;
		N = tmp;
	}
	return M;
}

void Simplify(rational&a)
{
	if (a.numerator < 0 && a.denominator < 0) {     // 负负得正！
		a.flag = 1;
		a.numerator = fabs(a.numerator);
		a.denominator = fabs(a.denominator);
	}

	else if (a.numerator < 0 || a.denominator < 0) {
		a.flag = -1;
		a.numerator = fabs(a.numerator);
		a.denominator = fabs(a.denominator);
	}

	if (a.numerator == 0) {
		a.flag = 0;
		return;
	}

	long long rem = gcd(a.numerator, a.denominator);
	if (rem > 1) {
		a.numerator /= rem;
		a.denominator /= rem;
	}

	if (a.numerator / a.denominator >= 1) {
		a.integer = a.numerator / a.denominator;
		a.numerator = a.numerator % a.denominator;
	}
}

void out(rational a)
{
	int flag = 0;
	if (a.flag == 0) {
		printf("0");
		return;
	}
	else if (a.flag == -1)
		printf("(-");

	if (a.integer != 0) {
		printf("%lld", a.integer);
		flag = 1;
	}

	if (a.numerator != 0) {
		if (flag)
			printf(" ");
		printf("%lld/%lld", a.numerator, a.denominator);
	}

	if (a.flag == -1)
		printf(")");
}