第八周实验(四)

* (程序头部注释开始)      
* 程序的版权和版本声明部分      
      
* Copyright (c) 2011, 烟台大学计算机学院学生      
      
* All rights reserved.      
      
* 文件名称:分数类中的对象可以和整型数进行四则运算,且运算符合交换律     
      
* 作 者:齐艳红      
      
 * 完成日期: 2011年 4月 18日      
      
*版 本 号:      
      
 * 对任务及求解方法的描述部分:分数类中的对象可以和整型数进行四则运算,且运算符合交换律       
 *问题描述:在任务3的基础上拓展。分数类中的对象可以和整型数进行四则运算,且运算符合交换律   
        
 * 程序输出:      
      
* 程序头部的注释结束*/ 
#include <iostream>   
using namespace std;  
class CFraction  
{  
private:  
	int nume;  // 分子   
	int deno;  // 分母   
public:  
	CFraction(int nu=0,int de=1):nume(nu),deno(de){}  
	void simplify();  
	void display();  

	friend CFraction operator+(const CFraction &c1, const CFraction &c2);  //两个分数相加,结果要化简   
	friend CFraction operator-(const CFraction &c1, const CFraction &c2);  //两个分数相减,结果要化简   
	friend CFraction operator*(const CFraction &c1, const CFraction &c2);  //两个分数相乘,结果要化简   
	friend CFraction operator/(const CFraction &c1, const CFraction &c2);  //两个分数相除,结果要化简   

	friend CFraction operator+(const CFraction &c, int i);    
	friend CFraction operator+(int i, const CFraction &c );    
	friend CFraction operator-(const CFraction &c, int i);    
	friend CFraction operator-(int i, const CFraction &c );    
	friend CFraction operator*(const CFraction &c, int i);    
	friend CFraction operator*(int i, const CFraction &c );    
	friend CFraction operator/(const CFraction &c, int i);    
	friend CFraction operator/(int i, const CFraction &c );    

	CFraction operator+();  //取正一目运算   
	CFraction operator-();  //取反一目运算   

	friend bool operator>(const CFraction &c1, const CFraction &c2);  //友元函数必须是两个参数c1,c2
	friend bool operator<(const CFraction &c1, const CFraction &c2);  
	friend bool operator==(const CFraction &c1, const CFraction &c2);  
	friend bool operator!=(const CFraction &c1, const CFraction &c2);  
	friend bool operator>=(const CFraction &c1, const CFraction &c2);  
	friend bool operator<=(const CFraction &c1, const CFraction &c2);  

	friend bool operator>(const CFraction &c, int i);  
	friend bool operator>(int i, const CFraction &c);  
	friend bool operator<(const CFraction &c, int i);  
	friend bool operator<(int i, const CFraction &c);      
	friend bool operator==(const CFraction &c, int i);  
	friend bool operator==(int i, const CFraction &c);    
	friend bool operator!=(const CFraction &c, int i);  
	friend bool operator!=(int i, const CFraction &c);  
	friend bool operator>=(const CFraction &c, int i);  
	friend bool operator>=(int i, const CFraction &c);  
	friend bool operator<=(const CFraction &c, int i);  
	friend bool operator<=(int i, const CFraction &c);  
};  

// 分数化简   
void CFraction::simplify()  
{  
	int m,n,r;  
	m=abs(deno);  
	n=abs(nume);  
	while(r=m%n)  // 求m,n的最大公约数   
	{  
		m=n;  
		n=r;  
	}  
	deno/=n;     // 化简   
	nume/=n;  
	if (deno<0)  // 将分母转化为正数   
	{  
		deno=-deno;  
		nume=-nume;  
	}  
}  

//显示分数   
void CFraction::display()  
{  
	cout<<"("<<nume<<"/"<<deno<<")"<<endl;  
}  

// 分数相加   
CFraction operator+(const CFraction &c1, const CFraction &c2)  
{  
	CFraction t;  
	t.nume=c1.nume*c2.deno+c2.nume*c1.deno;  
	t.deno=c1.deno*c2.deno;  
	t.simplify();  
	return t;  
}  

// 分数相减   
CFraction operator-(const CFraction &c1, const CFraction &c2)  
{  
	CFraction t;  
	t.nume=c1.nume*c2.deno-c2.nume*c1.deno;  
	t.deno=c1.deno*c2.deno;  
	t.simplify();  
	return t;  
}  

// 分数相乘   
CFraction operator*(const CFraction &c1, const CFraction &c2)  
{  
	CFraction t;  
	t.nume=c1.nume*c2.nume;  
	t.deno=c1.deno*c2.deno;  
	t.simplify();  
	return t;  
}  

// 分数相除   
CFraction operator/(const CFraction &c1, const CFraction &c2)  
{  
	CFraction t;  
	if (!c2.nume) return c1;  
	t.nume=c1.nume*c2.deno;  
	t.deno=c1.deno*c2.nume;  
	t.simplify();  
	return t;  
}  

CFraction operator+(const CFraction &c, int i)  
{  
	CFraction c1(c.nume+i*c.deno,c.deno);  
	c1.simplify();  
	return c1;  
}  

CFraction operator+(int i, const CFraction &c )  
{  
	CFraction c1(c.nume+i*c.deno,c.deno);  
	c1.simplify();  
	return c1;  
}  

CFraction operator-(const CFraction &c, int i)    
{  
	CFraction c1(c.nume-i*c.deno,c.deno);  
	c1.simplify();  
	return c1;  
}  

CFraction operator-(int i, const CFraction &c )  
{  
	CFraction c1(i*c.deno-c.nume,c.deno);  
	c1.simplify();  
	return c1;  
}  
CFraction operator*(const CFraction &c, int i)  
{  
	CFraction c1(c.nume*i,c.deno);  
	c1.simplify();  
	return c1;  
}  

CFraction operator*(int i, const CFraction &c )  
{  
	CFraction c1(c.nume*i,c.deno);  
	c1.simplify();  
	return c1;  
}  

CFraction operator/(const CFraction &c, int i)  
{  
	CFraction c1(c.nume,c.deno*i);  
	c1.simplify();  
	return c1;  
}  

CFraction operator/(int i, const CFraction &c )  
{  
	CFraction c1(i*c.deno,c.nume);  
	c1.simplify();  
	return c1;  
}  

// 分数取正号   
CFraction CFraction:: operator+()  
{  
	return *this;  
}  

// 分数取负号   
CFraction CFraction:: operator-()  
{  
	CFraction c;  
	c.nume=-nume;  
	c.deno=-deno;  
	return c;       
}  

// 分数比较大小   
bool operator>(const CFraction &c1, const CFraction &c2)  
{  
	int c1_nume,c2_nume,common_deno;  
	c1_nume=c1.nume*c2.deno;        // 计算分数通分后的分子,同分母为c1.deno*c2.deno   
	c2_nume=c2.nume*c1.deno;   
	common_deno=c1.deno*c2.deno;  
	//if (c1_nume>c2_nume) return true; 无法应对common_deno<0的情形   
	//下面的语句更简练的一种写法if ((c1_nume-c2_nume)*common_deno>0) return true;   
	if (c1_nume>c2_nume&&common_deno>0||c1_nume<c2_nume&&common_deno<0) return true; // 将通分后的分子比较大小   
	return false;  
}  

// 分数比较大小   
bool operator<(const CFraction &c1, const CFraction &c2)  
{  
	int c1_nume,c2_nume,common_deno;  
	c1_nume=c1.nume*c2.deno;        
	c2_nume=c2.nume*c1.deno;  
	common_deno=c1.deno*c2.deno;  
	if ((c1_nume-c2_nume)*common_deno<0) return true;   
	return false;  
}  

// 分数比较大小   
bool operator==(const CFraction &c1, const CFraction &c2)  
{  
	if (c1!=c2) return false;  
	return true;  
}  

// 分数比较大小   
bool operator!=(const CFraction &c1, const CFraction &c2)  
{  
	if (c1>c2 || c1<c2) return true;  
	return false;  
}  

// 分数比较大小   
bool operator>=(const CFraction &c1, const CFraction &c2)  
{  
	if (c1<c2) return false;  
	return true;  
}  

// 分数比较大小   
bool operator<=(const CFraction &c1, const CFraction &c2)  
{  
	if (c1>c2) return false;  
	return true;  
}  

bool operator>(const CFraction &c, int i)  
{  
	if(c.deno>0)   
		return c.nume>(i*c.deno);  
	else   
		return c.nume<(i*c.deno);  
}  

bool operator>(int i, const CFraction &c)  
{  
	if(c.deno>0)   
		return (i*c.deno)>c.nume;  
	else   
		return (i*c.deno)<c.nume;  
}  

bool operator<(const CFraction &c, int i)  
{  
	if(c.deno>0)   
		return c.nume<(i*c.deno);  
	else   
		return c.nume>(i*c.deno);  
}  

bool operator<(int i, const CFraction &c)  
{  
	if(c.deno>0)   
		return (i*c.deno)<c.nume;  
	else   
		return (i*c.deno)>c.nume;  
}  

bool operator==(const CFraction &c, int i)  
{  
	return c.nume==(i*c.deno);  
}  

bool operator==(int i, const CFraction &c)  
{  
	return c.nume==(i*c.deno);  
}  

bool operator!=(const CFraction &c, int i)  
{  
	return c.nume!=(i*c.deno);  
}  

bool operator!=(int i, const CFraction &c)  
{  
	return c.nume!=(i*c.deno);  
}  

bool operator>=(const CFraction &c, int i)  
{  
	return !(c<i); //用 !(c<i)符号代替>=
}  

bool operator>=(int i, const CFraction &c)  
{  
	return !(i<c);  
}  

bool operator<=(const CFraction &c, int i)  
{  
	return !(c>i);  
}  

bool operator<=(int i, const CFraction &c)  
{  
	return !(i>c);  
}  

int main()  
{  
	CFraction x(1,3),y(-5,10),s;  
	cout<<"两个分数为:x=1/3 ,y=-5/10"<<endl;  
	s=+x+y;  
	cout<<"分数相加及取正为:"<<"+x+y=";  
	s.display();  
	s=x-y;  
	cout<<"分数相减为:"<<"x-y=";  
	s.display();  
	s=x*y;  
	cout<<"分数相乘为:"<<"x*y=";  
	s.display();  
	s=x/y;  
	cout<<"分数相除为:"<<"x/y=";  
	s.display();  
	s=-x+y;  
	cout<<"分数取负为:"<<"-x+y=";  
	s.display();  
	x.display();  
	if (x>y) cout<<"大于"<<endl;  
	if (x<y) cout<<"小于"<<endl;  
	if (x==y)cout<<"等于"<<endl;  
	y.display();  
	cout<<endl;  
	system("pause");  
	return 0;  
}  

总结:这个程序还是有点迷糊滴,具体的探究还得继续,现在得保持不弄明白不罢休的态度学习才行啊!
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值