C语言的分数运算(简单版)

算法 同时被 2 个专栏收录
49 篇文章 1 订阅
20 篇文章 0 订阅
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
class Fraction {
public:
	ll up, down;
	bool isInf;

	Fraction(ll x = 0, ll y = 1) {
		up = x;
		down = y;
		isInf = false;
		this->reduction();
	}

	Fraction operator+(const Fraction& x) {
		Fraction res;
		res.up = this->up*x.down + this->down*x.up;
		res.down = this->down*x.down;
		res.reduction();
		return res;
	}

	Fraction operator-(const Fraction& x) {
		Fraction res;
		res.up = this->up*x.down - this->down*x.up;
		res.down = this->down*x.down;
		res.reduction();
		return res;
	}

	Fraction operator*(const Fraction& x) {
		Fraction res;
		res.up = this->up*x.up;
		res.down = this->down*x.down;
		res.reduction();
		return res;
	}

	Fraction operator/(const Fraction& x) {
		Fraction res;
		res.up = this->up*x.down;
		res.down = this->down*x.up;
		if (res.down != 0) {
			res.reduction();
		}
		else {
			res.isInf = true;
		}
		return res;
	}
	//显示分数 4种情况
	void showFraction() { 
		if (this->isInf) { // 分母为0
			printf("Inf");
			return;
		}
		//if (this->up < 0)printf("(");

		if (this->down == 1) { // 整数
			printf("%lld", this->up);
		}
		else if (abs(this->up) > abs(this->down)) { //假分数:分子>分母
			printf("%lld %lld/%lld", this->up / this->down, abs(this->up) % abs(this->down), this->down);
		}
		else { //真分数:分子<分母
			printf("%lld/%lld", this->up, this->down);
		}

		//if (this->up < 0)printf(")");
		//printf("\n");
	}
	//显示小数
	void showFloat() { 
		printf("%f\n", (double)this->up*1.0 / this->down);
	}

	ll getGcd(ll x, ll y) { // 辗转相除法求最大公约数
		if (y == 0)return x;
		else return getGcd(y, x%y);
	}


	void reduction() { // 化简
		if (this->down < 0) { // 如果分母小于0,则分子分母都取相反数
			this->up = -this->up;
			this->down = -this->down;
		}
		
		if (this->up == 0) { //如果分子为0,则令分母为1,方便输出函数处理
			this->down = 1;
		}
		else { //分子分母除以他们的最大公约数
			ll gcd = getGcd(abs(this->up), abs(this->down)); 
			this->up /= gcd;
			this->down /= gcd;
		}
	}
};

//对分数进行加减乘除运算
int main() {
	int n, up, down;
	Fraction x, y, z;
	char select[4] = { '+','-','*','/' };
	scanf("%lld/%lld %lld/%lld", &x.up, &x.down, &y.up, &y.down);
	x.reduction();
	y.reduction();
	for (int op = 0; op < 4; op++) {
		switch (op)
		{
		case 0: 
			z = x + y;
			break;
		case 1:
			z = x - y;
			break;
		case 2:
			z = x * y;
			break;
		case 3:
			z = x / y;
			break;
		}

		x.showFraction();
		printf(" %c ", select[op]);
		y.showFraction();
		printf(" = ");
		z.showFraction();
		printf("\n");
	}
	return 0;
}

以下是PAT的样例数据 

Sample Input 1:

2/3 -4/2

Sample Output 1:

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

Sample Input 2:

5/3 0/6

Sample Output 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
  • 0
    点赞
  • 0
    评论
  • 1
    收藏
  • 一键三连
    一键三连
  • 扫一扫,分享海报

©️2021 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值