分数的四则运算

#include <cstdio>
#include <algorithm>

using namespace std;

struct Fraction{
	int up,down; //分子 分母
};

//求最大公约数
int gcd(int a,int b){
	if(b==0) return a;
	else return gcd(b,a%b);
}

//分数化简
Fraction reduction(Fraction result){
	if(result.down<0){   //分母为负数,令分子和分母都变为相反数
		result.up = -result.up;
		result.down = -result.down;
	}

	if(result.up==0)  //如果分子为0
		result.down=1; //令分母等于1
	else{				//如果分子不为0,进行约分,同除以最大公约数
		int d = gcd(abs(result.up),abs(result.down));
		result.up/=d;
		result.down/=d;
	}
	return result;
}

//分数的加法
Fraction add(Fraction f1,Fraction f2){
	Fraction result;
	result.up=f1.up*f2.down+f2.up*f1.down;
	result.down=f1.down*f2.down;
	return reduction(result);
}

//分数的减法
Fraction minu(Fraction f1,Fraction f2){
	Fraction result;
	result.up=f1.up*f2.down-f2.up*f1.down;
	result.down=f1.down*f2.down;
	return reduction(result);
}

//分数的乘法
Fraction multi(Fraction f1,Fraction f2){
	Fraction result;
	result.up=f1.up*f2.up;
	result.down=f1.down*f2.down;
	return reduction(result);
}

//分数的除法
Fraction divide(Fraction f1,Fraction f2){
	Fraction result;
	result.up=f1.up*f2.down;
	result.down=f1.down*f2.up;
	return reduction(result);
}

//分数的输出
void showResult(Fraction r){
	r = reduction(r);
	if(r.down==1) printf("%lld",r.up);
	else if(abs(r.up)>abs(r.down)){
		//假分数
		printf("%d %d/%d",r.up/r.down,abs(r.up)%r.down,r.down);
	}else{ //真分数
		printf("%d/%d",r.up,r.down);
	}
}
int main() {

	return 0;
}

以下是一个简单的分数四则运算的 C++ 代码,可以进行加、减、乘、除和比较运算: ```c++ #include <iostream> #include <cmath> using namespace std; class Fraction { private: int numerator; // 分子 int denominator; // 分母 public: Fraction(int n, int d) { numerator = n; denominator = d; } void reduce() { int gcd = __gcd(numerator, denominator); numerator /= gcd; denominator /= gcd; } Fraction operator+(const Fraction& other) { int n = numerator * other.denominator + other.numerator * denominator; int d = denominator * other.denominator; Fraction result(n, d); result.reduce(); return result; } Fraction operator-(const Fraction& other) { int n = numerator * other.denominator - other.numerator * denominator; int d = denominator * other.denominator; Fraction result(n, d); result.reduce(); return result; } Fraction operator*(const Fraction& other) { int n = numerator * other.numerator; int d = denominator * other.denominator; Fraction result(n, d); result.reduce(); return result; } Fraction operator/(const Fraction& other) { int n = numerator * other.denominator; int d = denominator * other.numerator; Fraction result(n, d); result.reduce(); return result; } bool operator<(const Fraction& other) { return numerator * other.denominator < other.numerator * denominator; } bool operator>(const Fraction& other) { return numerator * other.denominator > other.numerator * denominator; } void print() { cout << numerator << "/" << denominator << endl; } }; int main() { Fraction a(1, 2); Fraction b(3, 4); Fraction c = a + b; c.print(); c = a - b; c.print(); c = a * b; c.print(); c = a / b; c.print(); cout << (a < b) << endl; cout << (a > b) << endl; return 0; } ``` 注意,这个代码只是一个简单的示例,没有考虑到分数的负数、零、约分等情况。在实际应用中,需要根据具体情况进行修改和完善。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

猪突猛进!

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值