PAT 乙级 1034 有理数四则运算 (20 分)

本题要求编写程序，计算 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

分析：

gcd、lcm分别是用来求最大公因数和最小公倍数的；reduction用来化简分数；printFra用来输出分数的形式；oppositeSigns用来比较两个数字是否是异号，另外四个函数对应加减乘除。

代码：下面的代码第二个测试点过不了；正确答案可以参考这篇文章

#include <iostream>
#include <algorithm>
#include <vector>

using namespace  std;

struct Fraction {
    long long down;
    long long up;
};

int gcd(int val1, int val2) {
    return val2 == 0 ? val1 : gcd(val2, val1 % val2);
}

int lcm(int val1, int val2) {
    int d = gcd(val1, val2);
    return val1 / d * val2;
}

void reduction(Fraction &fra) {
    if (fra.up < 0) {
        fra.up = -fra.up;
        fra.down = -fra.down;
    }

    if (fra.down == 0) {
        fra.up = 1;
    } else {
        int d = gcd(fra.up, fra.down);
        fra.up /= d;
        fra.down /= d;
    }
}

Fraction add(Fraction &fra1, Fraction &fra2) {
    Fraction temp;
    int l = lcm(fra1.down, fra2.down);
    temp.down =  l;
    temp.up = (l / fra1.down * fra1.up) + (l / fra2.down * fra2.up);
    reduction(temp);

    return temp;
}

Fraction sub(Fraction &fra1, Fraction &fra2) {
    Fraction temp;
    int l = lcm(fra1.down, fra2.down);
    temp.down =  l;
    temp.up = (l / fra1.down * fra1.up) - (l / fra2.down * fra2.up);
    reduction(temp);

    return temp;
}

Fraction mul(Fraction &fra1, Fraction &fra2) {
    Fraction temp;
    temp.down = fra1.down * fra2.down;
    temp.up = fra1.up * fra2.up;
    reduction(temp);

    return temp;
}

Fraction div(Fraction &fra1, Fraction &fra2) {
    Fraction temp;
    temp.up = fra1.up * fra2.down;
    temp.down = fra1.down * fra2.up;
    reduction(temp);

    return temp;
}

bool oppositeSigns(long long val1, long long val2) {
    return ((val1 < 0 && val2 > 0) || (val1 > 0 && val2 < 0));
}

void printFra(Fraction &fra) {
    reduction(fra);
    if (oppositeSigns(fra.down, fra.up)) {
        if (fra.down == 1)
            printf("(%lld)", fra.up);
        else if (abs(fra.up) > abs(fra.down))
            printf("(%lld %lld/%lld)", fra.up / fra.down, abs(fra.up) % fra.down, abs(fra.down));
        else
            printf("(-%lld/%lld)", abs(fra.up), abs(fra.down));
    } else {
        if (fra.up == 0)
            printf("0");
        else if (fra.down == 1)
            printf("%lld", fra.up);
        else if (fra.up > fra.down)
            printf("%lld %lld/%lld", fra.up / fra.down, fra.up % fra.down, fra.down);
        else
            printf("%lld/%lld", fra.up, fra.down);
    }
}

int main() {
    Fraction fra1, fra2;
    char ariop[4][4] = { " + ", " - ", " * ", " / " };
    scanf("%lld/%lld %lld/%lld", &fra1.up, &fra1.down, &fra2.up, &fra2.down);

    for (int i = 0; i < 4; i++) {
        printFra(fra1);
        cout << ariop[i];
        printFra(fra2);
        printf(" = ");
        Fraction temp;
        switch (i) {
            case 0:
                temp = add(fra1, fra2);
                printFra(temp);
                break;
            case 1:
                temp = sub(fra1, fra2);
                printFra(temp);
                break;
            case 2:
                temp = mul(fra1, fra2);
                printFra(temp);
                break;
            default:
                if (fra2.up == 0) {
                    cout << "Inf";
                } else {
                    temp = div(fra1, fra2);
                    printFra(temp);
                }
        }
        if (i != 3)
            cout << endl;
    }

    return 0;
}