题目描述
本题要求编写程序,计算2个有理数的和、差、积、商。
输入描述:
输入在一行中按照“a1/b1 a2/b2”的格式给出两个分数形式的有理数,其中分子和分母全是整型范围内的整数,负号只可能出现在分子前,分 母不为0。
输出描述:
分别在4行中按照“有理数1 运算符 有理数2 = 结果”的格式顺序输出2个有理数的和、差、积、商。注意输出的每个有理数必须是该有理数的 最简形式“k a/b”,其中k是整数部分,a/b是最简分数部分;若为负数,则须加括号;若除法分母为0,则输出“Inf”。题目保证正确的输出中 没有超过整型范围的整数。
输入例子:
5/3 0/6
输出例子:
1 2/3 + 0 = 1 2/3 1 2/3 - 0 = 1 2/3 1 2/3 * 0 = 0 1 2/3 / 0 = Inf
参考了大佬写得博客,乍一看这题有点复杂,分析好分数的加减乘除操作和简化,找最大公约数就清晰很多。
#include <iostream>
#include<algorithm>>
#include<iomanip>
#include<cmath>
using namespace std;
int gcd(long long a, long long b)//辗转相除求最大公约数
{
return b == 0 ? a : gcd(b, a % b);
}
void print(long long a, long long b)
{
long long c = 0;
if (a > 0)//以a为界定,正数
{
if (b == 1) //类似5/1
cout << a ;
else if (a > b) //类似5/3
{
c = a / b;
a -= b * c;
cout << c << " " << a << "/" << b;
}
else //真分数 3/5
{
cout << a << "/" << b;
}
}
else if (a == 0) // 类0/3
cout << "0";
else //负数 需要带着括号
{
if (b == 1)
cout << "("<<a<<")";
else if (-1 * a > b) //类似-5/3
{
c = a / b;
a = (-1 * a) % b;
cout <<"("<< c << " " << a << "/" << b<<")";
}
else //类似于-3/5
{
cout <<"("<< a << "/" << b<<")";
}
}
}
void add(long long a1, long b1, long long a2, long long b2)
{
print(a1, b1);
cout << " + ";
print(a2, b2);
cout << " = ";
long long a3 = a1 * b2 + a2 * b1;
long long b3 = b1 * b2;//计算
long long gcd3 = abs(gcd(a3, b3));
a3 /= gcd3;
b3 /= gcd3;//化简
print(a3, b3);
cout << endl;
}
void subtract(long long a1, long b1, long long a2, long long b2)
{
print(a1, b1);
cout << " - ";
print(a2, b2);
cout << " = ";
long long a3 = a1 * b2 - a2 * b1;
long long b3 = b1 * b2;
long long gcd3 = abs(gcd(a3, b3));
a3 /= gcd3;
b3 /= gcd3;
print(a3, b3);
cout << endl;
}
void nultiply(long long a1, long b1, long long a2, long long b2)
{
print(a1, b1);
cout << " * ";
print(a2, b2);
cout << " = ";
long long a3 = a1 * a2;
long long b3 = b1 * b2;
long long gcd3 = abs(gcd(a3, b3));
a3 /= gcd3;
b3 /= gcd3;
print(a3, b3);
cout << endl;
}
void divide(long long a1, long b1, long long a2, long long b2)
{
print(a1, b1);
cout << " / ";
print(a2, b2);
cout << " = ";
if (a2 == 0) cout << "Inf";
else if (a2 < 0) //负号跟着分母
{
long long a3 = -1 * a1 * b2;
long long b3 = -1 * a2 * b1;
//化简到最简形式,非带分数形式
long long gcd3 = abs(gcd(a3, b3));
a3 /= gcd3;
b3 /= gcd3;
print(a3, b3);
}
else
{
long long a3 = a1 * b2;
long long b3 = b1 * a2;
//化简到最简形式,非带分数形式
long long gcd3 = abs(gcd(a3, b3));
a3 /= gcd3;
b3 /= gcd3;
print(a3, b3);
}
cout << endl;
}
int main()
{
char temp;
long long a1, b1, a2, b2;
long long c1 = 0, c2 = 0;
cin >> a1 >>temp>> b1 >> a2 >>temp>> b2;
long long gcd1 = abs(gcd(a1, b1));
a1 /= gcd1;
b1 /= gcd1;
long long gcd2 = abs(gcd(a2, b2));
a2 /= gcd2;
b2 /= gcd2;
add(a1, b1, a2, b2);
subtract(a1, b1, a2, b2);
nultiply(a1, b1, a2, b2);
divide(a1, b1, a2, b2);
return 0;
}