分数类的四则运算

题目描述
编写分数类Fraction,实现两个分数的加、减、乘和除四则运算。主函数已给定。
输入
每行四个数,分别表示两个分数的分子和分母,以0 0 0 0 表示结束。
输出
空格分隔的两个分数的减和除的结果。
样例输入
1 2 -1 2
4 3 3 4
0 0 0 0
样例输出
1 -1

7/12 16/9

我的程序:

#include<iostream>
using namespace std;
class Fraction
{
private:
	int a,b;
public:
	friend istream& operator>>(istream&,Fraction&);
	friend Fraction operator-(Fraction&,Fraction&);
	friend Fraction operator/(Fraction&,Fraction&);
    friend bool operator==(Fraction&,int);
	void output();
};
istream & operator>>(istream &in,Fraction &c)
{
	in>>c.a>>c.b;
	return in;
}
Fraction operator-(Fraction &c1,Fraction &c2)
{
	Fraction c3;
	int temp,n,p,r,m;
	c3.a=c1.a*c2.b-c1.b*c2.a;
	c3.b=c1.b*c2.b;
	n=c3.a;
	m=c3.b;
	if(n<m)
	{
		temp=n;n=m;m=temp;
	}
	p=m*n;
	while(m!=0)
	{
		r=n%m;
		n=m;
		m=r;
	}
	c3.a=c3.a/n;
	c3.b=c3.b/n;
	return c3;
}
Fraction operator/(Fraction &c1,Fraction &c2)
{
	Fraction c3;
	c3.a=c1.a*c2.b;
	c3.b=c1.b*c2.a;
	int temp,n,p,r,m;
	n=c3.a;
	m=c3.b;
	if(n<m)
	{
		temp=n;n=m;m=temp;
	}
	p=m*n;
	while(m!=0)
	{
		r=n%m;
		n=m;
		m=r;
	}
	c3.a=c3.a/n;
	c3.b=c3.b/n;
	return c3;
}
bool operator==(Fraction &c1,int a)
{
	a=0;
	if(c1.a==a&&c1.b==a)
		return 1;
	else
		return 0;
}

void Fraction::output()
{
	if(a==b)
		cout<<"1";
	else if(a==(-b))
		cout<<"-1";
	else if((a>0&&b>0)||(a<0&&b<0))
		cout<<a<<"/"<<b;
	else if(a<0&&b>0)
		cout<<"-"<<-a<<"/"<<b;
    else
        cout<<"-"<<a<<"/"<<-b;
}
int main()
{
	Fraction f1,f2,f3;
	while(cin>>f1>>f2)
	{
		if(f1==0&&f2==0)
			break;
		f3=f1-f2;
		f3.output();
        cout<<" ";
		f3=f1/f2;
		f3.output();
		cout<<endl;
	}
	return 0;
}

运行结果:




  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 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
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值