7-33 有理数加法 (15 分)C++

#include <iostream>
#include <string>
using namespace std;
/*
*要解决几个问题
*输入的问题
*求和的问题
*化简的问题
*/
int Min(int a,int b) {
	return (a > b) ? b : a;
}

int main()
{
	int Min(int a, int b);
	//输入的问题
	int a, b, c, d;
	char s1, s2,s3;
	cin >> a >> s1 >> b;
	cin.get(s2);
	cin >> c >> s3 >> d;
	//求和的问题
	int deno = b * d;//分母
	int mole = a * d + b *c;//分子
	//化简问题
	//找分子分母中大的,然后遍历
	int factor = 0;
	int init = 1;
	for (; init <= Min(deno, mole); ++init) {
		if (deno % init == 0) {
			if (mole % init == 0) {
				factor = init;
			}
		}
	}
	if (deno / factor == 1) {
		cout << mole / factor << endl;
	}
	else {
		cout << mole / factor << "/" << deno / factor << endl;
	}
	

	return 0;
}
  • 2
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
以下是 C++ 中有理数的加减乘除运算示例代码: ```c++ #include <iostream> using namespace std; class Rational { private: int numerator; // 子 int denominator; // 母 public: // 构造函数 Rational(int numerator = 0, int denominator = 1) { if (denominator == 0) { cout << "Error: denominator cannot be 0!" << endl; exit(1); } if (numerator == 0) { this->numerator = 0; this->denominator = 1; } else { int gcd = getGCD(numerator, denominator); this->numerator = numerator / gcd; this->denominator = denominator / gcd; if (this->denominator < 0) { this->numerator = -this->numerator; this->denominator = -this->denominator; } } } // 获取最大公约数 int getGCD(int a, int b) { if (b == 0) return a; return getGCD(b, a % b); } // 加法运算 Rational operator+(Rational const& r) { int newNumerator = this->numerator * r.denominator + r.numerator * this->denominator; int newDenominator = this->denominator * r.denominator; return Rational(newNumerator, newDenominator); } // 减法运算 Rational operator-(Rational const& r) { int newNumerator = this->numerator * r.denominator - r.numerator * this->denominator; int newDenominator = this->denominator * r.denominator; return Rational(newNumerator, newDenominator); } // 乘法运算 Rational operator*(Rational const& r) { int newNumerator = this->numerator * r.numerator; int newDenominator = this->denominator * r.denominator; return Rational(newNumerator, newDenominator); } // 除法运算 Rational operator/(Rational const& r) { if (r.numerator == 0) { cout << "Error: division by 0!" << endl; exit(1); } int newNumerator = this->numerator * r.denominator; int newDenominator = this->denominator * r.numerator; return Rational(newNumerator, newDenominator); } // 输出有理数 friend ostream& operator<<(ostream& os, Rational const& r) { if (r.denominator == 1) { os << r.numerator; } else { os << r.numerator << "/" << r.denominator; } return os; } }; int main() { Rational a(1, 2); Rational b(3, 4); Rational c = a + b; Rational d = a - b; Rational e = a * b; Rational f = a / b; cout << "a = " << a << endl; cout << "b = " << b << endl; cout << "a + b = " << c << endl; cout << "a - b = " << d << endl; cout << "a * b = " << e << endl; cout << "a / b = " << f << endl; return 0; } ``` 输出结果: ``` a = 1/2 b = 3/4 a + b = 5/4 a - b = -1/4 a * b = 3/8 a / b = 2/3 ```

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值