第八周上机任务项目四

/*
* 程序的版权和版本声明部分
* Copyright (c)2013, 烟台大学计算机学院学生
* All rightsreserved.
* 作    者：   耿娜
* 完成日期： 2013 年 4 月  24 日
* 版本号： 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 simplify();
	void output();
	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);
	friend CFraction operator+(CFraction &c2,int &d);
	friend CFraction operator+(int &d,CFraction &c2);
	friend CFraction operator-(CFraction &c2,int &d);
	friend CFraction operator-(int &d,CFraction &c2);
	friend CFraction operator*(CFraction &c2,int &d);
	friend CFraction operator*(int &d,CFraction &c2);
	friend CFraction operator/(CFraction &c2,int &d);
	friend CFraction operator/(int &d,CFraction &c2);
};
CFraction::CFraction(int nu,int de)
{
	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()
{
    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(deno,nume);
}
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;
}
CFraction operator+(CFraction &c2,int &d)
{
    return CFraction(c2.nume+d*c2.deno,c2.deno);
}
CFraction operator+(int &d,CFraction &c2)
{
    return CFraction(c2.nume+d*c2.deno,c2.deno);
}
CFraction operator-(CFraction &c2,int &d)
{
    return CFraction(c2.nume-d*c2.deno,c2.deno);
}
CFraction operator-(int &d,CFraction &c2)
{
    return CFraction(d*c2.deno-c2.nume,c2.deno);
}
CFraction operator*(CFraction &c2,int &d)
{
    return CFraction(d*c2.nume,c2.deno);
}
CFraction operator*(int &d,CFraction &c2)
{
    return CFraction(d*c2.nume,c2.deno);
}
CFraction operator/(CFraction &c2,int &d)
{
    return CFraction(c2.nume,c2.deno*d);
}
CFraction operator/(int &d,CFraction &c2)
{
    return CFraction(d*c2.deno,c2.nume);
}
int main()
{
    CFraction c1(1,2),c2(2,3),c3;
    int d=2;
    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=c1/c2;
    cout<<"c1/c2=";
    c3.output();

    c3=-c1;
    cout<<"c1取反";
    c3.output();

    c3=d+c1;
    cout<<"d+c1=";
    c3.output();

    c3=c1+d;
    cout<<"c1+d=";
    c3.output();

    c3=d-c1;
    cout<<"d-c1=";
    c3.output();

    c3=c1-d;
    cout<<"c1-d=";
    c3.output();

    c3=d*c1;
    cout<<"d*c1=";
    c3.output();

    c3=c1*d;
    cout<<"c1*d=";
    c3.output();

    c3=d/c1;
    cout<<"d/c1=";
    c3.output();

    c3=c1/d;
    cout<<"c1/d=";
    c3.output();

	return 0;

}