1034. 有理数四则运算(20)

1034. 有理数四则运算(20)
时间限制 200 ms 内存限制 65536 kB 代码长度限制 8000 B
判题程序 Standard 作者 CHEN, Yue

本题要求编写程序，计算2个有理数的和、差、积、商。
输入格式：
输入在一行中按照“a1/b1 a2/b2”的格式给出两个分数形式的有理数，其中分子和分母全是整型范围内的整数，负号只可能出现在分子前，分母不为0。
输出格式：
分别在4行中按照“有理数1 运算符 有理数2 = 结果”的格式顺序输出2个有理数的和、差、积、商。注意输出的每个有理数必须是该有理数的最简形式“k a/b”，其中k是整数部分，a/b是最简分数部分；若为负数，则须加括号；若除法分母为0，则输出“Inf”。题目保证正确的输出中没有超过整型范围的整数。
输入样例1：
2/3 -4/2
输出样例1：
2/3 + (-2) = (-1 1/3)
2/3 - (-2) = 2 2/3
2/3 * (-2) = (-1 1/3)
2/3 / (-2) = (-1/3)
输入样例2：
5/3 0/6
输出样例2：
1 2/3 + 0 = 1 2/3
1 2/3 - 0 = 1 2/3
1 2/3 * 0 = 0
1 2/3 / 0 = Inf

#define _CRT_SECURE_NO_WARNINGS
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <map>

using namespace std;

typedef struct Rational
{
    long int numerator;
    long int denominator;
}Rational;


long int gcd(long int a, long int b)
{
    if (b == 0)return a;
    return gcd(b, a%b);
}

void check(Rational &a)
{
    if (a.denominator == 0)
    {
        a.numerator = 0;
        a.denominator = 1;
    }
    else if (a.denominator < 0)
    {
        a.numerator = -a.numerator;
        a.denominator = -a.denominator;
    }
}

void Reduction(Rational &re)
{
    check(re);
    long int g = gcd(abs(re.numerator), abs(re.denominator));
    re.numerator /= g;
    re.denominator /= g;
}

Rational Add(Rational a, Rational b)
{
    Rational res;
    check(a);
    check(b);
    res.numerator = a.numerator * b.denominator + b.numerator * a.denominator;
    res.denominator = a.denominator * b.denominator;
    Reduction(res);
    return res;
}

Rational Sub(Rational a, Rational b)
{
    Rational res;
    check(a);
    check(b);
    res.numerator = a.numerator * b.denominator - b.numerator * a.denominator;
    res.denominator = a.denominator * b.denominator;
    Reduction(res);
    return res;
}


Rational Product(Rational a, Rational b)
{
    Rational res;
    check(a);
    check(b);
    res.numerator = a.numerator * b.numerator;
    res.denominator = b.denominator * a.denominator;
    Reduction(res);
    return res;
}

bool Quotient(Rational &res,Rational a, Rational b)
{
    if (b.numerator == 0)return true;
    res.numerator = a.numerator * b.denominator;
    res.denominator = a.denominator * b.numerator;
    check(res);
    Reduction(res);
    return false;
}

void Print(Rational a, bool inf)
{
    if (inf)
    {
        printf("Inf");
        return;
    }

    if (a.numerator < 0)printf("(");

    if (a.denominator == 1)printf("%ld", a.numerator);
    else if (abs(a.numerator) > a.denominator) printf("%ld %ld/%ld", a.numerator / a.denominator, abs(a.numerator) % a.denominator, a.denominator);
    else printf("%ld/%ld", a.numerator, a.denominator);

    if (a.numerator < 0)printf(")");
}

void Calc(Rational a, Rational b)
{
    Rational res;
    Reduction(a); Reduction(b);

    Print(a, false); printf(" + ");
    Print(b, false); printf(" = ");
    res = Add(a, b);
    Print(res, false); printf("\n");

    Print(a, false); printf(" - ");
    Print(b, false); printf(" = ");
    res = Sub(a, b);
    Print(res, false); printf("\n");

    Print(a, false); printf(" * ");
    Print(b, false); printf(" = ");
    res = Product(a, b);
    Print(res, false); printf("\n");

    bool inf;
    inf = Quotient(res, a, b);
    Print(a, false); printf(" / ");
    Print(b, false); printf(" = ");
    Print(res, inf);
}


int main()
{
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif // _DEBUG

    int n;
    Rational a,b;
    scanf("%ld/%ld %ld/%ld", &a.numerator, &a.denominator, &b.numerator, &b.denominator);
    Calc(a, b);

    return 0;
}