编号及代码:
/*
*Copyright(c)2015,烟台大学计算机与工程学院
*All rights reserved;
*文件名称:score.cpp
*作者:范星月
*完成日期:2015年4月26日
*版本号:v1.0
*
*问题描述:实现分数类中运算符的重载,在分数类中完成加减乘除(并化简),比较6中关系运算符的运算
*问题输入:无
*问题输出:如下
*/
#include <iostream>
#include<cmath>
using namespace std;
class CFraction
{
private:
int nume;//fenzi
int deno;//fenmu
public:
void simplify();
void display();
CFraction(int nu=0,int de=1):nume(nu),deno(de){};
CFraction operator+(const CFraction &);
CFraction operator-(const CFraction &);
CFraction operator*(const CFraction &);
CFraction operator/(const CFraction &);
bool operator>(const CFraction &);
bool operator<(const CFraction &);
bool operator>=(const CFraction &);
bool operator<=(const CFraction &);
bool operator ==(const CFraction &);
bool operator!=(const CFraction &);
};
void CFraction::simplify()
{
int n,m,r;
m=(fabs(nume));
n=(fabs(deno));
while(m%n>0)
{
r=m%n;
m=n;
n=r;
}
nume/=n;
deno/=n;
if(deno<0)
{
nume=-nume;
deno=-deno;
}
}
void CFraction::display()
{
cout<<"("<<nume<<"/"<<deno<<")"<<endl;
}
CFraction CFraction::operator+(const CFraction &c)
{
CFraction t;
t.nume=nume*c.deno+c.nume*deno;
t.deno=deno*c.deno;
t.simplify();
return t;
}
CFraction CFraction::operator-(const CFraction &c)
{
CFraction t;
t.nume=nume*c.deno-c.nume*deno;
t.deno=deno*t.deno;
t.simplify();
return t;
}
CFraction CFraction::operator*(const CFraction &c)
{
CFraction t;
t.nume=nume*c.nume;
t.deno=deno*c.deno;
t.simplify();
return t;
}
CFraction CFraction::operator/(const CFraction &c)
{
CFraction t;
t.nume=nume*c.deno;
t.deno=deno*c.nume;
t.simplify();
return t;
}
bool CFraction::operator>(const CFraction &c)
{
int this_nume, c_nume,common_deno;
this_nume=nume*c.deno;
c_nume=c.nume*deno;
common_deno=deno*c.deno;
if((this_nume>c_nume&&common_deno>0)||(this_nume<c_nume&&common_deno<0))return true;
return false;
}
bool CFraction::operator<(const CFraction &c)
{
int this_nume, c_nume,common_deno;
this_nume=nume*c.deno;
c_nume=c.nume*deno;
common_deno=deno*c.deno;
if((this_nume-c_nume)*common_deno<0)return true;
return false;
}
bool CFraction::operator>=(const CFraction &c)
{
if(*this<c)return false;
return true;
}
bool CFraction::operator<=(const CFraction &c)
{
if(*this>c)return false;
return true;
}
bool CFraction::operator==(const CFraction &c)
{
if(*this==c)return true;
return false;
}
bool CFraction::operator!=(const CFraction &c)
{
if(*this==c)return false;
return true;
}
int main()
{
CFraction c1(1,2),c2(2,3),c;
cout<<"c1=";
c1.display();
cout<<"c2=";
c2.display();
c=c1+c2;
cout<<"c1+c2=";
c.display();
c=c1-c2;
cout<<"c1-c2=";
c.display();
c=c1*c2;
cout<<"c1*c2=";
c.display();
c=c1/c2;
cout<<"c1/c2=";
c.display();
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;
return 0;
}
运行结果:
学习总结:
在化简求最大公约数时,不能while(r!=0)因为r 没有赋予初值