【PAT乙级】1034 有理数四则运算(20)

本题要求编写程序，计算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

思路：首先这道题目应该想着怎么化简假分数与真分数，加减乘除操作都可以分子分母进行运算之后得出新的分子分母然后再化简，带分数的整数部分好求，那么就要将剩下的分数化为最简形式。分子分母同时除以它的最大公约数就可以化为最简了，代码如下：求最小公倍数与最大公约数可以参考这篇文章：https://blog.csdn.net/qq_31828515/article/details/51812154

#include <iostream>
#include <cmath>

using namespace std;
struct number
{
	long long int k, fenz, fenm;
};
long long int a1, b1, a2, b2;
long long int maxgongyueshu(long long int x,long long int y)
{
	long long int z = y;
	while (x%y != 0)
	{
		z = x%y;
		x = y;
		y = z;
	}
	return z;
}
void huajian(long long int afenz,long long int afenm)
{
	if (afenm == 0)
	{
		cout << "Inf";
		return;
	}
	if (afenz == 0)
	{
		cout << 0;
		return;
	}
	number tmp;
	long long int maxyue;
	if (abs(afenz) > abs(afenm))
	{
		tmp.k = afenz / afenm;
		if (abs(afenz)%abs(afenm) == 0)
		{
			tmp.fenz = 0;
			tmp.fenm = 0;
		}
		else
		{
			tmp.fenz = abs(afenz) - abs(tmp.k)*abs(afenm);
			maxyue = maxgongyueshu(abs(tmp.fenz), abs(afenm));
			tmp.fenz = tmp.fenz / maxyue;
			tmp.fenm = abs(afenm) / maxyue;
		}
	}
	else if (abs(afenz) == abs(afenm))
	{
		tmp.k = afenz / afenm;
		tmp.fenz = 0;
		tmp.fenm = 0;
	}
	else
	{
		tmp.k = 0;
		maxyue = maxgongyueshu(abs(afenz), abs(afenm));
		tmp.fenz = afenz / maxyue;
		tmp.fenm = afenm / maxyue;
	}

	///输出
	if (tmp.k == 0)
	{
		if (tmp.fenz * tmp.fenm < 0)
			cout << "(-" << abs(tmp.fenz) << "/" << abs(tmp.fenm) << ")";
		else
			cout << tmp.fenz << "/" << tmp.fenm;
	}
	else
	{
		if (tmp.fenz == 0 && tmp.fenm == 0)
		{
			if (tmp.k>0)
				cout << tmp.k;
			else
				cout << "(" << tmp.k << ")";
		}
		else
		{
			if (tmp.k>0)
				cout << tmp.k<<" "<<tmp.fenz<<"/"<<tmp.fenm;
			else
				cout << "(" << tmp.k << " " << tmp.fenz << "/" << tmp.fenm<<")";
		}
	}
}

void add()
{
	long long int m,n;
	m = a1*b2 + a2*b1;
	n = b1*b2;
	huajian(a1, b1);
	cout << " + ";
	huajian(a2, b2);
	cout << " = ";
	huajian(m, n);
	cout << endl;
}

void mins()
{
	long long int m, n;
	m = a1*b2 - a2*b1;
	n = b1*b2;
	huajian(a1, b1);
	cout << " - ";
	huajian(a2, b2);
	cout << " = ";
	huajian(m, n);
	cout << endl;
}

void multi()
{
	long long int m, n;
	m = a1*a2;
	n = b1*b2;
	huajian(a1, b1);
	cout << " * ";
	huajian(a2, b2);
	cout << " = ";
	huajian(m, n);
	cout << endl;
}
void div()
{
	long long int m, n;
	m = a1*b2;
	n = b1*a2;
	huajian(a1, b1);
	cout << " / ";
	huajian(a2, b2);
	cout << " = ";
	huajian(m, n);
	cout << endl;
}
int main()
{
	scanf("%lld/%lld", &a1, &b1);
	scanf("%lld/%lld", &a2, &b2);
	add();
	mins();
	multi();
	div();
	return 0;
}