问题描述:
有理数是一个可以化为一个分数的数,例如2/3,533/920,-12/49都是有理数,而就为无理数。在C++中,并没有预先定义有理数,需要时可以定义一个有理数类,将有理数的分子和分母分别存放在两个整型变量中。对有理数的各种操作都可以用重载运算符来实现。
基本要求:
定义并实现一个有理数类,通过重载运算符+、-、*、/对有理数进行算术运算,通过重载运算符==实现判定两个有理数是否相等。写一个优化函数,它的作用是使有理数约去公分母,也即是使保存的有理数分子和分母之间没有公约数(除去1以外)。此外,还要定义一个将有理数转换为实数的函数,再加上构造函数和有理数输出函数。
测试数据:
在应用程序中,创建若干有理数对象,通过带参数的构造函数使得各有理数对象值各不相同,然后分别进行各类运算,输出运算结果,检验其正确性。
实现提示:
设有两个有理数a/b和c/d,则有:
(1) 有理数相加 分子=ad+bc;分母=bd
(2) 有理数相减 分子=ad-bc;分母=bd
(3) 有理数相乘 分子=ac; 分母=bd
(4) 有理数相除 分子=ad; 分母=bc
(5) 重载插入(<<)和提取(>>)运算符,使得对有理数可以直接输入输出。
设有理数输入格式为:
整数1 整数2 //整数1为分子,整数2为分母
有理数输出格式为:
分子/分母
优化函数在创建有理数对象时应执行,在执行其它各种运算之后也需执行它,这样可保证所存储的有理数随时都是最优的。对于判断两个有理数是否相等,由于在对有理数进行各种运算后都对其进行优化,所以判定两个有理数是否相等只需判定它们两个的分子和分母分别相等即可。
RationalNumber.h
#pragma once
class RationalNumber{
private:
int numerator;
int denominator;
public:
RationalNumber();
RationalNumber(int, int);
int gcd(int, int);
void set(int, int);
void print();
void add(RationalNumber);
void sub(RationalNumber);
void mul(RationalNumber);
void div(RationalNumber);
bool operator==(RationalNumber);
};
RationalNumber.cpp
#include "RationalNumber.h"
#include<iostream>
using namespace std;
RationalNumber::RationalNumber(){}
RationalNumber::RationalNumber(int numerator, int denominator) {
int temp = gcd(numerator, denominator);
this->numerator = numerator / temp;
this->denominator = denominator / temp;
}
int RationalNumber::gcd(int n,int m) {
int t;
if (n < m) {
t = n;
n = m;
m = t;
}
if (n % m == 0) {
return m;
}
else {
return gcd(m, n % m);
}
}
void RationalNumber::set(int n, int d)
{
numerator = n;
denominator = d;
int temp = gcd(numerator, denominator);
numerator /= temp;
denominator /= temp;
}
void RationalNumber::print() {
cout << numerator << "/" << denominator << "\n";
}
void RationalNumber::add(RationalNumber r)
{
numerator = numerator * r.denominator + denominator * r.numerator;
denominator = r.denominator * denominator;
int temp = gcd(numerator, denominator);
numerator /= temp;
denominator /= temp;
}
void RationalNumber::sub(RationalNumber r)
{
numerator = numerator * r.denominator - denominator * r.numerator;
denominator = r.denominator * denominator;
int temp = gcd(numerator, denominator);
numerator /= temp;
denominator /= temp;
}
void RationalNumber::mul(RationalNumber r)
{
numerator *= r.numerator;
denominator *= r.denominator;
int temp = gcd(numerator, denominator);
numerator /= temp;
denominator /= temp;
}
void RationalNumber::div(RationalNumber r)
{
numerator *= r.denominator;
denominator *= r.numerator;
int temp = gcd(numerator, denominator);
numerator /= temp;
denominator /= temp;
}
bool RationalNumber::operator==(RationalNumber r)
{
if (numerator == r.numerator &&
denominator == r.denominator) {
return true;
}
return false;
}
test.cpp
#include <iostream>
using namespace std;
#include"RationalNumber.h";
int main() {
RationalNumber r1, r2;
r1.set(7,26);
r2.set(6, 26);
r1.print();
r2.print();
r1.add(r2);
r1.print();
bool flag = r1 == RationalNumber(1, 2);
if (flag) {
cout << "Yes";
}
else
{
cout << "No";
}
}