关闭

定义分数的一目运算+和-,分别代表分数取正和求反,将“按位取反运算符”~重载为分数的求倒数运算。

396人阅读 评论(0) 收藏 举报
/*
*Copyright (c) 2016,烟台大学计算机学院
*All rights reserved.
*文件名称:main.cpp
*作    者:郭辉
*完成时间:2016年6月1日
*版 本 号:v1.0
*
*问题描述:定义分数的一目运算+和-,分别代表分数取正和求反,将“按位取反运算符”~重载为分数的求倒数运算。 
*输入描述:无。
*程序输出:分数。
*/
#include<iostream>
using namespace std;
class CFraction
{
private:
	int nume;//fenzi
	int deno;//fenmu
public:
	CFraction(int a=0,int b=0);
	
	void show();
	CFraction operator+(double c);
	CFraction operator-(double c);
	CFraction operator*(double c);
	CFraction operator/(double c);
	bool  operator>(CFraction &c);
	bool  operator<(CFraction &c);
	bool operator==(CFraction &c);
	bool  operator>=(CFraction &c);
	bool  operator<=(CFraction &c);
	bool  operator!=(CFraction &c);
	CFraction operator+();
	CFraction operator-();
	CFraction operator~();
};
CFraction CFraction::operator~()
{
	int a=nume,b=deno,t;
	t=a;
	a=b;
	b=t;
	CFraction c(a,b);
	return c;
}
CFraction CFraction::operator+()
{
	return *this;
}
CFraction CFraction::operator-()
{
	int mu,zi;
	mu=deno;
	zi=-nume;
	CFraction t(zi,mu);
	return t;
}
bool  CFraction::operator>(CFraction &c)
{
	int mu,zi1,zi2;
	mu=deno*c.deno;
	zi1=nume*c.deno;
	zi2=c.nume*deno;
	if(zi1>zi2)
		return true;
	else 
		return false;

		
}
bool CFraction::operator<(CFraction &c)
{
	int mu,zi1,zi2;
	mu=deno*c.deno;
	zi1=nume*c.deno;
	zi2=c.nume*deno;
	if(zi1< zi2)
		return true;
	else 
		return false;

		
}
bool CFraction::operator==(CFraction &c)
{
	int mu,zi1,zi2;
	mu=deno*c.deno;
	zi1=nume*c.deno;
	zi2=c.nume*deno;
	if(zi1==zi2)
		return true;
	else 
		return false;

		
}
bool  CFraction::operator<=(CFraction &c)
{
	int mu,zi1,zi2;
	mu=deno*c.deno;
	zi1=nume*c.deno;
	zi2=c.nume*deno;
	if(zi1<=zi2)
		return true;
	else 
		return false;

		
}
bool  CFraction::operator>=(CFraction &c)
{
	int mu,zi1,zi2;
	mu=deno*c.deno;
	zi1=nume*c.deno;
	zi2=c.nume*deno;
	if(zi1>=zi2)
		return true;
	else 
		return false;		
}
bool  CFraction::operator!=(CFraction &c)
{
	int mu,zi1,zi2;
	mu=deno*c.deno;
	zi1=nume*c.deno;
	zi2=c.nume*deno;
	if(zi1!=zi2)
		return true;
	else 
		return false;		
}
CFraction::CFraction(int a,int b)
{
	nume=a;
	deno=b;
}
CFraction CFraction::operator+(double c)
{
	int zi;
	
	zi=nume+c*deno;
	CFraction t(zi,deno);
	return t;
}
CFraction CFraction::operator-(double c)
{
		int zi;
	
	zi=nume-c*deno;
	CFraction t(zi,deno);
	return t;
}
CFraction CFraction::operator*(double c)
{
		int zi;
	
	zi=nume*c;
	CFraction t(zi,deno);
	return t;
}
CFraction CFraction::operator/(double c)
{
		int mu;
	
	mu=deno*c;
	CFraction t(nume,mu);
	return t;
}
void CFraction::show()
{int t,m,r,n;
	m=deno;
	n=nume;
	if(deno<nume)
	{
		t=m;
		m=n;
		n=t;
	}
	
	while(r=m%n)  
    {
        m=n;
        n=r;
    }
	deno=deno/n;
	nume=nume/n;
	if(deno==1)
		cout<<nume<<endl;
	else
	cout<<nume<<"/"<<deno<<endl;

}
int main()
{
	CFraction  c1(1,2),c2(2,3),c3;
	c3=c1+2;
	c3.show();
	c3=c1-2;
	c3.show();
	c3=c1*2;
	c3.show();
	c3=c1/2;
	c3.show();
	if(c1>c2)
		cout<<"c1>c2"<<endl;
	if(c1<c2)
		cout<<"c1<c2"<<endl;
	if(c1==c2)
		cout<<"c1==c2"<<endl;
	if(c1>=c2)
		cout<<"c1>=c2"<<endl;
	if(c1<=c2)
		cout<<"c1<=c2"<<endl;
	if(c1!=c2)
		cout<<"c1!=c2"<<endl;
	
	c3=c1.operator -();
	cout<<"-c1=";
	c3.show();
	cout<<endl;
	c3=c1.operator +();
   	cout<<"+c1=";
	c3.show();
	cout<<endl;
	cout<<"x的倒数: ";
	c3=c1.operator ~();
	c3.show();
return 0;
}
运行结果:
<img src="http://img.blog.csdn.net/20160601135453993" alt="" />

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:19026次
    • 积分:729
    • 等级:
    • 排名:千里之外
    • 原创:56篇
    • 转载:1篇
    • 译文:0篇
    • 评论:2条
    文章分类
    最新评论