B1034 有理数四则运算

测试点2，将所有int改为long long int后过。

#include<iostream>
#define INF 100000000
using namespace std;
struct node
{
	long long int m;
	long long int zi;
	long long int mu;
};
long long int Gcd(long long int a,long long int b)
{
	return b == 0 ? a : Gcd(b, a%b);
}
void Pluse(node &x,node a, node b)
{
	long long int c = a.mu*b.mu / Gcd(a.mu, b.mu);
	x.mu = c;
	x.zi = a.zi*c / a.mu + b.zi*c / b.mu;
}
void Sub(node &x, node a, node b)
{
	long long int c = a.mu*b.mu / Gcd(a.mu, b.mu);
	x.mu = c;
	x.zi = a.zi*c / a.mu - b.zi*c / b.mu;
}
void Mul(node &x, node a, node b)
{
	x.zi = a.zi*b.zi;
	x.mu = a.mu*b.mu;
}
void Sep(node &x, node a, node b)
{
	x.zi = a.zi*b.mu;
	x.mu = a.mu*b.zi;
	if (x.mu == 0)
		x.mu = INF;
}
void Sip(node &x)
{
	if (x.mu == INF)
		return;
	x.m = x.zi / x.mu;
	//if(x.m<0)	x.zi =abs( x.zi - x.m*x.mu);
	x.zi = x.zi - x.m*x.mu;
	
	long long int c=Gcd(x.zi, x.mu);
	x.zi = x.zi / c;
	x.mu = x.mu / c;
	if (x.mu < 0)
	{
		x.zi = 0 - x.zi;
		x.mu = 0 - x.mu;
	}
	if (x.m < 0)x.zi = abs(x.zi);
}
void Out1(node x)
{
	if (x.mu == INF) {
		cout << "Inf"; return;
	}
	int flag = 0;
	if (x.m!=0)
	{
		if (x.m < 0) {
			cout << "("; flag = 1;
		}
		cout << x.m;
	}
	if (x.m&&x.zi)
		cout << " ";
	if (x.zi)
	{
		if (x.m == 0 && x.zi < 0) {
			cout << "("; flag = 1;
		}
		cout << x.zi << "/" << x.mu;
	}
			
	if (x.m == 0 && x.zi == 0)
		cout << "0";
	if (flag)cout << ")";
}
int main()
{
	node a, b,x1,x2,x3,x4;
	x1.zi = 0; x1.mu = 1;
	x2.zi = 0; x2.mu = 1;
	x3.zi = 0; x3.mu = 1;
	x4.zi = 0; x4.mu = 1;
	cin >> a.zi; getchar(); cin >> a.mu;
	cin >> b.zi; getchar(); cin >> b.mu;
	Pluse(x1, a, b);
	Sub(x2, a, b);
	Mul(x3, a, b);
	Sep(x4, a, b);

	Sip(a);
	Sip(b);
	Sip(x1);
	Sip(x2);
	Sip(x3);
	Sip(x4);
	
	Out1(a); cout << " + "; Out1(b); cout << " = "; Out1(x1); cout << endl;
	Out1(a); cout << " - "; Out1(b); cout << " = "; Out1(x2); cout << endl;
	Out1(a); cout << " * "; Out1(b); cout << " = "; Out1(x3); cout << endl;
	Out1(a); cout << " / "; Out1(b); cout << " = "; Out1(x4); cout << endl;
	system("pause");
	return 0;

}