第八周 项目3-分数类中的运算符重载（2）

/* 
 * Copyright (c) 2014, 烟台大学计算机学院 
 * All rights reserved. 
 * 文件名称：test.cpp 
 * 作    者：呼亚萍 
 * 完成日期：2015年5月8日 
 * 版 本 号：v1.0 
 * 
 * 问题描述：实现分数类中的运算符重载，在分数类中可以完成分数的加减乘除（运算后再化简）、比较（6种关系）的运算。
 * 程序输入：相应的程序
 * 程序输出：对应得结果
 */

#include <iostream>
using namespace std;

class CFraction
{
public:
    CFraction(int nu=0,int de=1):nume(nu),deno(de) {}
    void simplify();
    //两个分数运算
    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 &c1, int &i);
    friend CFraction operator-(const CFraction &c1,int &i);
    friend CFraction operator*(const CFraction &c1,int &i);
    friend CFraction operator/(const CFraction &c1,int &i);

    friend CFraction operator+(int &i,const CFraction &c1);
    friend CFraction operator-(int &i,const CFraction &c1);
    friend CFraction operator*(int &i,const CFraction &c1);
    friend CFraction operator/(int &i,const CFraction &c1);
    //比较大小
    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 &c1,const CFraction &c2);

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

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

 

    void display();
    CFraction operator+();//取正一目运算
    CFraction operator-();//取反一目运算
private:
    int nume;//分子
    int deno;//分母
};
void CFraction::simplify()
{
    int m,n,r;
    m=abs(deno);
    n=abs(nume);
    while(r=m%n)  // 求m，n的最大公约数
    {
        m=n;
        n=r;
    }
    nume=nume/n;
    deno=deno/n;
    if((deno<0)&&(nume<0))
    {
        deno*=(-1);
        nume*=(-1);
    }
    if((deno<0)&&(nume>0))
    {
        deno*=(-1);
        nume*=(-1);
    }
}
CFraction CFraction::operator+()
{
    return *this;
}
CFraction CFraction::operator-()
{
    CFraction c;
    c.nume=-nume;
    c.deno=deno;
    return c;

}
CFraction operator+(const CFraction &c,const CFraction &c1)
{
    CFraction m;
    m.deno=c1.deno*c.deno;
    m.nume=c1.nume*c.deno+c.nume*c1.deno;
    m.simplify();
    return m;
}
CFraction operator-(const CFraction &c,const CFraction &c1)
{
    CFraction m;
    m.deno=c1.deno*c.deno;
    m.nume=c1.nume*c.deno-c.nume*c1.deno;
    m.simplify();
    return m;
}
CFraction operator*(const CFraction &c,const CFraction &c1)
{
    CFraction m;
    m.nume=c1.nume*c.nume;
    m.deno=c1.deno*c.deno;
    m.simplify();
    return m;

}
CFraction operator/(const CFraction &c,const CFraction &c1)
{
    CFraction m;
    if (!c1.nume) return c;
    m.nume=c1.nume*c.deno;
    m.deno=c1.deno*c.nume;
    m.simplify();
    return m;
}
CFraction operator+(const CFraction &c1, int &i)
{
    CFraction c(c1.nume+(i*c1.deno),c1.deno);
    c.simplify();
    return c;
}
CFraction operator-(const CFraction &c1,int &i)
{
    CFraction c(c1.nume-i*c1.deno,c1.deno);
    c.simplify();
    return c;
}
CFraction operator*(const CFraction &c1,int &i)
{
    CFraction c(c1.nume*i,c1.deno);
    c.simplify();
    return c;
}
CFraction operator/(const CFraction &c1,int &i)
{
    CFraction c(c1.nume,c1.deno*i);
    c.simplify();
    return c;
}
CFraction operator+(int &i,const CFraction &c1)
{
    CFraction c(c1.nume+i*c1.deno,c1.deno);
    c.simplify();
    return c;
}
CFraction operator-(int &i,const CFraction &c1)
{
    CFraction c(c1.nume-i*c1.deno,c1.deno);
    c.simplify();
    return c;
}
CFraction operator*(int &i,const CFraction &c1)
{
    CFraction c(c1.nume*i,c1.deno);
    c.simplify();
    return c;
}
CFraction operator/(int &i,const CFraction &c1)
{
    CFraction c(c1.nume,c1.deno*i);
    c.simplify();
    return c;
}


bool operator>(const CFraction &c,const CFraction &c1)
{
    int this_nume,c_nume,common_deno;
    this_nume=c1.nume*c.deno;        // 计算分数通分后的分子，同分母为deno*c.deno
    c_nume=c.nume*c1.deno;
    common_deno=c1.deno*c.deno;
    if ((this_nume>c_nume&&common_deno>0)||(this_nume<c_nume&&common_deno<0)) return true; // 将通分后的分子比较大小
    return false;

}
bool operator<(const CFraction &c,const CFraction &c1)
{
    int this_nume,c_nume,common_deno;
    this_nume=c1.nume*c.deno;
    c_nume=c.nume*c1.deno;
    common_deno=c1.deno*c.deno;
    if ((this_nume-c_nume)*common_deno<0) return true;
    return false;

}
bool operator>=(const CFraction &c,const CFraction &c1)
{
    if(c<c1)
        return false;
    else
        return true;
}
bool  operator<=(const CFraction &c,const CFraction &c1)
{
    if(c>c1)
        return false;
    else
        return true;
}
bool operator==(const CFraction &c,const CFraction &c1)
{
    if(c>c1||c<c1)
        return false;
    else
        return true;
}
bool  operator!=(const CFraction &c,const CFraction &c1)
{
    if(c1==c)
        return false;
    else
        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<(const CFraction &c,int i)
{
    if(c.deno>0)
        return c.nume<(i*c.deno);
    else
        return c.nume>(i*c.deno);//将分数为正为负的情况皆进行了考虑
}
bool operator==(const CFraction &c,int i)
{
    return c.nume=(i*c.deno);
}
bool operator!=(const CFraction &c,int i)
{
    return c.nume!=(i*c.deno);
}
bool operator>=(const CFraction &c,int i)
{
    if(c<i)
        return false;
    else
        return true;
}
bool operator=<(const CFraction &c,int i)
{
    return!(c>i);
}


bool operator>(int i,const CFraction &c)
{
    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 c.nume<(i*c.deno);
    else
        return c.nume>(i*c.deno);//将分数为正为负的情况皆进行了考虑
}
bool operator==(int i,const CFraction &c)
{
    return c.nume=(i*c.deno);
}
bool operator!=(int i,const CFraction &c)
{
    return c.nume!=(i*c.deno);
}
bool operator>=(int i,const CFraction &c)
{
    if(i<c)
        return false;
    else
        return true;
}
bool operator=<(const CFraction &c,int i)
{
    return!(i>c);
}


void CFraction::display()
{
    if(nume==deno)
        cout<<"1"<<endl;
    else
        cout<<"("<<nume<<"/"<<deno<<")"<<endl;
}
int main()
{
    CFraction c1(1,3),c2(-5,10),s;
    cout<<"c1=1/3"<<'\t'<<"c2=-5/10"<<endl;
    s=c1+c2;
    cout<<"c1+c2=";
    s.display();
    s=c1-c2;
    cout<<"c1-c2=";
    s.display();
    s=c1*c2;
    cout<<"c1*c2=";
    s.display();
    s=c1/c2;
    cout<<"c1/c2=";
    s.display();
    s=-c1+c2;
    cout<<"-c1+c2=";
    s.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;

    CFraction c1(5,3),c2;
    c2=c1+5;
    c2=5+c1;

    c2=c1-5;
    c2=5-c1;

    c2=c1*5;
    c2=5*c1;

    c2=c1/5;
    c2=5/c1;

    bool b;
    b=(c1>2);
    b=(2>c1);
    return 0;
}

运算结果：

知识点总结：

实现了分数与整数的相加，

学习心得：

一个非常大的程序可以分成多个小部分完成