A1088 Rational Arithmetic (20 分)

做起来确实很长,注意全部要用long long,否则很多测试点通不过。

#include<cstdio>
#include<algorithm>
using namespace std;
int gcd(long long a, long long b)
{
	if (b == 0) return a;
	else return gcd(b,a%b);
}
struct fraction
{
	long long up, down;
}a,b;
fraction reduction(fraction result)
{
	if (result.up == 0) result.down = 1;
	else
	{
		long long x = gcd(abs(result.up), result.down);
		result.up /= x;
		result.down /= x;
	}
	return result;
}
void showresult(fraction a)
{
	if (a.up > 0)
	{
		if (a.down == 1) printf("%lld", a.up);
		else if (a.up > a.down)
		{
			printf("%lld %lld/%lld", a.up / a.down, abs(a.up%a.down), a.down);
		}
		else if (a.up == a.down) printf("%lld", a.up);
		else printf("%lld/%lld", a.up, a.down);
	}
	else if (a.up == 0) printf("0");
	else
	{
		printf("(");
		if (a.down == 1) printf("%lld", a.up);
		else if (abs(a.up) > a.down)
		{
			printf("%lld %lld/%lld", a.up / a.down, abs(a.up%a.down), a.down);
		}
		else if (a.up == a.down) printf("%lld", a.up);
		else printf("%lld/%lld", a.up, a.down);
		printf(")");
	}
}
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);
}
fraction mins(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);
}
fraction mult(fraction a, fraction b)
{
	fraction result;
	result.up = a.up*b.up;
	result.down = a.down*b.down;
	return reduction(result);
}
fraction div(fraction a, fraction b)
{
	fraction result;
		result.up = a.up*b.down;
		result.down = a.down*b.up;
		if (result.down < 0)
		{
			result.up = -result.up;
			result.down = -result.down;
		}
		return reduction(result);
	
}
int main()
{
	
	scanf("%lld/%lld %lld/%lld", &a.up, &a.down, &b.up, &b.down);
	a = reduction(a), b = reduction(b);
	showresult(a);
	printf(" + ");
	showresult(b);
	printf(" = ");
	showresult(add(a, b));
	printf("\n");


	showresult(a);
	printf(" - ");
	showresult(b);
	printf(" = ");
	showresult(mins(a, b));
	printf("\n");


	showresult(a);
	printf(" * ");
	showresult(b);
	printf(" = ");
	showresult(mult(a, b));
	printf("\n");

	showresult(a);
	printf(" / ");
	showresult(b);
	printf(" = ");
	if (b.up == 0) printf("Inf");
	else showresult(div(a, b));
	printf("\n");
	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值