第八周C++上机报告（项目3__分数运算符重载）

/** 程序的版权和版本声明部分* Copyright (c)2013, 烟台大学计算机学院学生* All rightsreserved.* 文件名称：score.cpp* 作    者：   王昕彤* 完成日期： 2013 年 4 月  26 日* 版本号： v1.0* 输入描述：已经在程序中初始化* 问题描述：分数处理* 输出：*/#include <iostream>using namespace std;int gcd(int m, int n);class CFraction{private:    int nume;  // 分子    int deno;  // 分母public:    CFraction(int nu=0,int de=1);   //构造函数，初始化用    void set(int nu=0,int de=1);    //置值，改变值时用    void output(int style=0);    void simplify();    CFraction operator+(CFraction &c2);    CFraction operator-(CFraction &c2);    CFraction operator*(CFraction &c2);    CFraction operator/(CFraction &c2);    CFraction operator-(); //求反    bool operator>(CFraction &c2);    bool operator<(CFraction &c2);    bool operator==(CFraction &c2);};CFraction::CFraction(int nu,int de) //构造函数，初始化用{    if (de!=0)    {        nume=nu;        deno=de;    }    else    {        cerr<<"初始化中发生错误，程序退出\n";        //system("pause");        //exit(0);    }}void CFraction::set(int nu,int de)    //置值，改变值时用{    if (de!=0) //如果不合适，改变值操作无效    {        nume=nu;        deno=de;    }}void CFraction::simplify(){    int n=gcd(deno, nume);    deno/=n;     // 化简    nume/=n;}// 求m，n的最大公约数int gcd(int m, int n) //这个函数可以定义为类的成员函数，也可以为一般函数{    int r;    if (m<n)    {        r=m;        m=n;        n=r;    }    while(r==m%n)  // 求m，n的最大公约数    {        m=n;        n=r;    }    return n;}void CFraction::output(int style){    int n;    switch(style)    {    case 0:        cout<<"原样:" <<nume<<'/'<<deno<<endl;        break;    case 1:        n=gcd(deno, nume);        cout<<"化简形式: "<<nume/n<<'/'<<deno/n<<endl;     //输出化简形式，并不是要化简        break;    case 2:        cout<<"带分数形式:" <<nume/deno<<'('<<nume%deno<<'/'<<deno<<')'<<endl;        break;    case 3:        cout<<"近似值:" <<nume/double(deno)<<endl;        break;    default:        cout<<"默认原样:" <<nume<<'/'<<deno<<endl;    }}CFraction CFraction::operator+(CFraction &c2){    return CFraction(nume*c2.deno+deno*c2.nume,deno*c2.deno);}CFraction CFraction::operator-(CFraction &c2){    return CFraction(nume*c2.deno-deno*c2.nume,deno*c2.deno);}CFraction CFraction::operator*(CFraction &c2){    return CFraction(nume*c2.nume,deno*c2.deno);}CFraction CFraction::operator/(CFraction &c2){    return CFraction(nume*c2.deno,deno*c2.nume);}CFraction CFraction::operator-(){    return CFraction(-nume,-deno);}bool CFraction::operator>(CFraction &c2){    if(nume*c2.deno>deno*c2.nume)        return true;    else        return false;}bool CFraction::operator<(CFraction &c2){    if(nume*c2.deno<deno*c2.nume)        return true;    else        return false;}bool CFraction::operator==(CFraction &c2){    if(nume*c2.deno==deno*c2.nume)        return true;    else        return false;}int main(){    CFraction c1(1,2),c2(2,3),c3;    cout<<"c1=";    c1.output();    cout<<"c2=";    c2.output();    cout<<"下面比较两个分数大小：\n";    if (c1>c2) cout<<"c1>c2"<<endl;    if (c1<c2) cout<<"c1<c2"<<endl;    if (c1==c2) cout<<"c1=c2"<<endl;    cout<<endl;    c3=c1+c2;    cout<<"c1+c2=";    c3.output();    c3=c1-c2;    cout<<"c1-c2=";    c3.output();    c3=c1*c2;    cout<<"c1*c2=";    c3.output();    c3.output(1);    c3=c1/c2;    cout<<"c1/c2=";    c3.output();    c3=-c1;    cout<<"c1取反";    c3.output();    return 0;}

运行结果：