第三週任務三之分數類運算符的重載

和任務2遇到了相似的問題，看不出來了...

源程序:

/*(文件註釋頭部開始） 
*程序的版權和版本聲明部分 
*Copyright (c) 2011,煙臺大學計算機學院學生 
*All rights reserved. 
*文件名稱：分數類運算符的重載
*作    者：2011級計114-3張宗佳 
*完成日期：2011年4月11號 
*版本號：vc
* 對任務及求解方法的描述部分 
* 輸入描術：
* 問題描述：實現分數類中的運算符重載，在分數類中可以完成分數的加減乘除（運算後再化簡）、求反、比較（6種關係）的運算。
* 程序輸出：
* 程序頭部的註釋結束 
*/  
#include<iostream>

using namespace std;

int gcd(int a,int b);
class CFraction
{
private:
	int nume;  // 分子
	int deno;  // 分母
public:
	//構造函數及運算符重載的函數聲明
	CFraction(int nu = 0,int de = 1);  

	CFraction operator + (CFraction &c1);
	CFraction operator - (CFraction &c1);
	CFraction operator * (CFraction &c1);
	CFraction operator / (CFraction &c1);

	bool operator > (CFraction &c1);
	bool operator < (CFraction &c1);
	bool operator >= (CFraction &c1);
	bool operator <= (CFraction &c1);
	bool operator = (CFraction &c1);
	bool operator != (CFraction &c1);
	CFraction operator - ();//求反

	void Simplify();				

	void output();	

};
//重載函數的實現及用於測試的main()函數
CFraction::CFraction(int nu,int de) 
{
	nume = nu;

	deno = de;
}

CFraction CFraction::operator + (CFraction &c1)
{
	CFraction c;

	c.nume = deno * c1.nume + nume * c1.deno;

	c.deno = deno * c1.deno;

	c.Simplify();

	return c;
}

CFraction CFraction::operator - (CFraction &c1)
{
	CFraction c;

	c.nume = nume * c1.deno - deno * c1.nume;

	c.deno = deno * c1.deno;

	c.Simplify();

	return c;
}
CFraction CFraction::operator * (CFraction &c1)
{
	CFraction c;

	c.nume = nume * c1.nume;

	c.deno = deno * c1.deno;

	c.Simplify();

	return c;
}

CFraction CFraction::operator / (CFraction &c1)
{
	CFraction c;

	c.nume = nume * c1.deno;

	c.deno = deno * c1.nume;

    c.Simplify();

	return c;
}
bool CFraction::operator > (CFraction &c1)
{
	if(nume * c1.deno > deno * c1.nume)
	{
		return true;
	}
	else 
	{
		return false;
	}
}
bool CFraction::operator < (CFraction &c1)
{
	if(nume * c1.deno < deno * c1.nume)
	{
		return true;
	}
	else 
	{
		return false;
	}
}
bool CFraction::operator >= (CFraction &c1)
{
	if(nume * c1.deno < deno * c1.nume)
	{
		return false;
	}
	else 
	{
		return true;
	}
}

bool CFraction::operator <= (CFraction &c1)
{
	if(nume * c1.deno > deno * c1.nume)
	{
		return false;
	}
	else 
	{
		return true;
	}
}
bool CFraction::operator = (CFraction &c1)
{
	if(nume * c1.deno == deno * c1.nume)
	{
		return true;
	}
	else 
	{
		return false;
	}
}
bool CFraction::operator != (CFraction &c1)
{
	if(nume * c1.deno != deno * c1.nume)
	{
		return true;
	}
	else 
	{
		return false;
	}
}
//求反
CFraction CFraction::operator - ()
{
	return 	CFraction(-nume,deno);
}
	


void CFraction::Simplify()
{
	int t,n,d;

	n = nume;

	d = deno; 

	while(n > 0)
	{
		t = d % n;
		d = n;
		n = t;
	}
	nume = nume / n;
	deno = deno / n;
	return;
}

void CFraction::output()
{
	cout << nume << "/" << deno << endl;
}
void main()
{
	CFraction c1(3,5),c2(4,7),c3;

	cout << "c1=";
	c1.output();

	cout << "c2=";
	c2.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 / c2;
	cout << "c1/c2=";
	c3.output();

	cout<<"下面比較兩個分數的大小：\n";
	if (c1 > c2) cout << "t1>t2" << endl;
	if (c1 < c2) cout << "t1<t2" << endl;
	if (c1 = c2) cout << "t1＝t2" << endl; 
	if (c1 != c2) cout << "t1≠t2" << endl;
	if (c1 >= c2) cout << "t1≥t2" << endl;
	if (c1 <= c2) cout << "t1≤t2" << endl;

	c3 = - c1;
	cout << "c1的相反數是：";
	c3.output();

	system("pause");
}