【PTA-1088】有理数的四则运算

【PTA-1088】有理数的四则运算
分析： 和【PTA-1081】有理数的和
一样是一道有理数运算处理问题
注意： 细节处理，括号，负数符号的位置，需要熟练掌握最大公约数的基本模板

LL gcd(LL a,LL b)
{  
   return b?gcd(b,a%b):a;
}

#include <iostream>
using namespace std;
typedef long long LL;

LL gcd(LL a, LL b)
{
    return b ? gcd(b, a % b) : a;
}

void print(LL a, LL b)
{
    LL t = gcd(a, b);
    a /= t, b /= t;
    // 1.目的是将负数换到分子去
    if (b < 0)
        a *= -1, b *= -1;
    // 2. 处理负数需要添加符号的问题
    bool is_minus = a < 0;
    if (is_minus)
        cout << "(";

    // 3. 处理和有理数相加一样的输出问题
    if (b == 1) // 如果是整数
        cout << a;
    // 处理假分数问题 这里处理假分数还需要考虑负数的情况
    else
    {
        if (abs(a) >= b)
            printf("%lld ", a / b), a = abs(a) % b;
        printf("%lld/%lld", a, b);
    }
    if (is_minus)
        cout << ")";
}

void add(LL a, LL b, LL c, LL d)
{
    // a/b+c/d = a*d+b*c;
    print(a, b), cout << " + ", print(c, d), cout << " = ";
    a = a * d + b * c;
    b = b * d;
    print(a, b), cout << endl;
}

void sub(LL a, LL b, LL c, LL d)
{
    print(a, b), cout << " - ", print(c, d), cout << " = ";
    a = a * d - b * c;
    b = b * d;
    print(a, b), cout << endl;
}

void mul(LL a, LL b, LL c, LL d)
{
    // a/b*c/d = a*c/b*d;
    print(a, b), cout << " * ", print(c, d), cout << " = ";
    a = a * c;
    b = b * d;
    print(a, b), cout << endl;
}

void div(LL a, LL b, LL c, LL d)
{
    // a/b / c/d  = a*d / b*c
    print(a, b), cout << " / ", print(c, d), cout << " = ";
    if (!c)
        cout << "Inf" << endl;
    else
    {
        a = a * d;
        b = b * c;
        print(a, b), cout << endl;
    }
}

int main(int argc, char const *argv[])
{
    LL a, b, c, d;
    scanf("%lld/%lld %lld/%lld", &a, &b, &c, &d);

    add(a, b, c, d);
    sub(a, b, c, d);
    mul(a, b, c, d);
    div(a, b, c, d);

    return 0;
}