运算符重载 分数类

 

#include<iostream>
using namespace std;
#include<Cmath>

int gcd(int m, int n)
{
 int r;
 if (m < n)
 {
  r = m;
  m = n;
  n = r;
 }
 while(r = m % n)
 {
  m=n;
  n=r;
 }
 return n;
}

class RationalNumber
{
private:
 int son;//分子
 int moth;//分母
public:
 RationalNumber()
 {
  int son = 0;
  int moth = 1;
 }//赋初值
    RationalNumber(int s,int m)
 {
  int e=gcd(s, m);
  son = s / e;      
  moth = m / e;
 }


    RationalNumber operator + (const RationalNumber &c);
    RationalNumber operator - (const RationalNumber &c);
    RationalNumber operator * (const RationalNumber &c);
    RationalNumber operator / (const RationalNumber &c);
    bool operator == (const RationalNumber &c);
    bool operator < (const RationalNumber &c);
    bool operator <= (const RationalNumber &c);
    bool operator > (const RationalNumber &c);
    bool operator >= (const RationalNumber &c);
    bool operator != (const RationalNumber &c);
    void display();

};

inline RationalNumber RationalNumber::operator + (const RationalNumber &c)
{
    return RationalNumber(son * c.moth + moth * c.son,moth * c.moth);
}

inline RationalNumber RationalNumber::operator - (const RationalNumber &c)
{
 return RationalNumber(son * c.moth - moth * c.son,moth * c.moth);
}

inline RationalNumber RationalNumber::operator * (const RationalNumber &c)
{
 return RationalNumber(son * c.son, moth * c.moth);
}

inline RationalNumber RationalNumber::operator / (const RationalNumber &c)
{
 return RationalNumber(son * c.moth,moth * c.son);
}

inline bool RationalNumber::operator == (const RationalNumber &c)
{
 if(son * c.moth - moth * c.son,moth * c.moth == 0)
  return true;
 else
  return false;
}

inline bool RationalNumber::operator < (const RationalNumber &c)
{
 if(son * c.moth - moth * c.son,moth * c.moth < 0)
  return true;
 else
  return false;
}

inline bool RationalNumber::operator <= (const RationalNumber &c)
{
 if(son * c.moth - moth * c.son,moth * c.moth <= 0)
  return true;
 else
  return false;
}

inline bool RationalNumber::operator > (const RationalNumber &c)
{
 if(son * c.moth - moth * c.son,moth * c.moth > 0)
  return true;
 else
  return false;
}

inline bool RationalNumber::operator >= (const RationalNumber &c)
{
 if(son * c.moth - moth * c.son,moth * c.moth >= 0)
  return true;
 else
  return false;
}
inline bool RationalNumber::operator != (const RationalNumber &c)
{
 if(son * c.moth - moth * c.son,moth * c.moth != 0)
  return true;
 else
  return false;
}


void RationalNumber::display()
{
 cout << son << "/" << moth << endl;
}
int main()
{
 RationalNumber c1(3,8),c2(7,16),c;
 cout << "c1为:";
 c1.display();
 cout << "c2为:";
 c2.display();

 cout << "下面比较两个数大小:\n";
 
 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;

    cout << "下面计算两个数的加减乘除" << endl;

 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();
 cout << endl;
 return 0;
}


 


  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值