1034 有理数四则运算 (20 分)

写了两个小时 第一次完全自己写100+行代码叭大概 已AC看起来有点冗余 过几天有空再删改删改吧 诶嘿嘿 希望复试顺利~ 

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
char aa[4] = {'+', '-', '*', '/'};
struct Fraction
{
	LL k,up, down;	
};
LL gcd(LL a, LL b)
{
	if(a < b) swap(a, b);
	if(b == 0) return a;
	else return gcd(b, a % b);
}
Fraction simply(Fraction a)
{
	if(a.up == 0) //零 
	{
		a.k = 0;
		a.up = 0;
		a.down = 0;
	
	}
	else
	{
		if(a.up % a.down == 0) //整数 
		{
			a.k = a.up / a.down;
			a.up = 0;
			a.down = 0;
		} 
		else  //分数 
		{
			LL x = gcd(abs(a.up), a.down);
			a.up /= x;
			a.down /= x;
			if(abs(a.up)> a.down) 
			{
				a.k = a.up / a.down;
				a.up = abs(a.up) % a.down;
			}
		}
		
	}
	
	return a;
}
void showshow(Fraction a)
{
	
	if(a.k != 0)
	{
		if(a.k < 0) printf("(");
		
		if(a.up != 0) printf("%lld %lld/%lld", a.k, a.up, a.down);
		else 		  printf("%lld", a.k);
		
		if(a.k < 0) printf(")");
	}
	
	else
	{
		if(a.up < 0) printf("(");
		
		if(a.up == 0) printf("0");
		else 	      printf("%lld/%lld", a.up, a.down);
		
		if(a.up < 0) printf(")");
	}
	
}
void show_ans(Fraction a, Fraction b, Fraction c,int i)
{
	showshow(a);
	
	printf(" %c ", aa[i]);
	
	showshow(b);
	
	printf(" = ");
	
	if(i == 3 && b.k == 0 && b.up == 0) printf("Inf");
	else     showshow(c);
	
	printf("\n");
} 
int main()
{
	Fraction tmp1, tmp2, ans,a1,a2;
	tmp1.k = 0, tmp2.k = 0,a1.k = 0, a2.k = 0,ans.k = 0;
	scanf("%lld/%lld %lld/%lld", &tmp1.up, &tmp1.down, &tmp2.up, &tmp2.down);
	a1 = simply(tmp1);
	a2 = simply(tmp2);

	ans.up = tmp1.up * tmp2.down + tmp2.up * tmp1.down;
	ans.down = tmp1.down * tmp2.down;
	ans = simply(ans);
	
	show_ans(a1, a2, ans,0);
	
	ans.k = 0;
	ans.up = tmp1.up * tmp2.down - tmp2.up * tmp1.down;
	ans.down = tmp1.down * tmp2.down;
	ans = simply(ans);
	
	show_ans(a1, a2, ans, 1);
	
	ans.k = 0;
	ans.up = tmp1.up * tmp2.up;
	ans.down = tmp1.down * tmp2.down;
	ans = simply(ans);
	
	show_ans(a1, a2, ans, 2);
	
	ans.k = 0;
	if(tmp2.up == 0) show_ans(a1, a2, ans, 3);
	else
	{
		ans.up = tmp1.up * tmp2.down;
		ans.down = tmp1.down * tmp2.up;
		if(ans.down < 0)
		{
			ans.down = -ans.down;
			ans.up = - ans.up;
		}
		ans = simply(ans);
		show_ans(a1, a2, ans, 3);
	}
	
	
	return 0;
}