PATA1088_模拟（难度：⭐️⭐️⭐️）

这个题难度应该是表达，分数的四则运算大家都会但是就是要考虑特殊情况。记住可以简化的方法，减法可以用后一个数乘（-1），除法可以用后一个数的倒数，这样就少写了两个方法。

#include<bits/stdc++.h>
using namespace std;
struct node {
    long long up, down;
};
long long gcd(long long a, long long b) {
    return b == 0 ? a : gcd(b, a % b);
}
void show(node a) {
    int flag = 0;
    if (a.up == 0 || a.down == 0) {
        if (a.up == 0) printf ("0");
        else printf ("Inf");
        return;
    }
    if ((a.up < 0 && a.down > 0) || (a.up > 0 && a.down < 0)) {
        printf ("(-");
        flag = 1;
    }
    a.up = abs(a.up); a.down = abs(a.down);
    long long temp = gcd(a.up, a.down);
    a.up /= temp; a.down /= temp;
    if (a.up / a.down != 0) {
        printf ("%d", a.up / a.down);
        if (a.up % a.down != 0) printf (" ");
    }
    if (a.up % a.down != 0) printf("%d/%d", a.up % a.down, a.down);
    if (flag == 1) printf (")");
}
void sum(node a, node b, int flag) {
    long long up = a.down * b.up + flag * a.up * b.down;
    long long down = a.down * (flag) * b.down;
    show(a);
    if (flag == 1) printf (" + ");
    else printf (" - ");
    show(b);
    printf (" = ");
    show(node{up, down});
    printf ("\n");
}
void product (node a, node b, int flag) {
    node temp = b;
    if (flag == 1) {
        long long temp = b.up;
        b.up = b.down;
        b.down = temp;
    }
    long long up = a.up * b.up;
    long long down = a.down * b.down;
    show(a);
    if (flag == 0) printf (" * ");
    else printf (" / ");
    show(temp);
    printf (" = ");
    show(node{up, down});
    printf ("\n");
}
int main() {
    node a, b;
    scanf ("%lld/%lld %lld/%lld", &a.up, &a.down, &b.up, &b.down);
    sum (a, b, 1);
    sum (a, b, -1);
    product (a, b, 0);
    product (a, b, 1);
}