# PAT 1088 Rational Arithmetic (20 分) -甲级

1088 Rational Arithmetic (20 分)

For two rational numbers, your task is to implement the basic arithmetics, that is, to calculate their sum, difference, product and quotient.

### Input Specification:

Each input file contains one test case, which gives in one line the two rational numbers in the format a1/b1 a2/b2. The numerators and the denominators are all in the range of long int. If there is a negative sign, it must appear only in front of the numerator. The denominators are guaranteed to be non-zero numbers.

### Output Specification:

For each test case, print in 4 lines the sum, difference, product and quotient of the two rational numbers, respectively. The format of each line is number1 operator number2 = result. Notice that all the rational numbers must be in their simplest form k a/b, where k is the integer part, and a/b is the simplest fraction part. If the number is negative, it must be included in a pair of parentheses. If the denominator in the division is zero, output Inf as the result. It is guaranteed that all the output integers are in the range of long int.

### Sample Input 1:

2/3 -4/2


### Sample Output 1:

2/3 + (-2) = (-1 1/3)
2/3 - (-2) = 2 2/3
2/3 * (-2) = (-1 1/3)
2/3 / (-2) = (-1/3)


### Sample Input 2:

5/3 0/6


### Sample Output 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

//
// Created by shuji on 2019/8/19.
//
#include <stdio.h>
#include <algorithm>

using namespace std;

struct Fraction {
long long up;
long long down;
} f1, f2;

//long long gcd(long long a, long long b) {
//    return b == 0 ? a : gcd(b, a % b);
//}

Fraction reduction(Fraction result) {
if (result.down < 0) {
result.up = -result.up;
result.down = -result.down;
}
if (result.up == 0) {
result.down = 1;
} else {
long long d = __gcd(abs(result.up), abs(result.down));
result.up /= d;
result.down /= d;
}
return result;
}

Fraction add(Fraction f1, Fraction f2) {
Fraction result;
result.up = f1.up * f2.down + f2.up * f1.down;
result.down = f1.down * f2.down;
return reduction(result);
}

Fraction minu(Fraction f1, Fraction f2) {
Fraction result;
result.up = f1.up * f2.down - f2.up * f1.down;
result.down = f1.down * f2.down;
return reduction(result);
}

Fraction multi(Fraction f1, Fraction f2) {
Fraction result;
result.up = f1.up * f2.up;
result.down = f1.down * f2.down;
return reduction(result);
}

Fraction divide(Fraction f1, Fraction f2) {
Fraction result;
result.up = f1.up * f2.down;
result.down = f1.down * f2.up;
return reduction(result);
}

void Print(Fraction result) {
result = reduction(result);
if (result.up < 0) {
printf("(");
}
if (result.down == 1) {
printf("%lld", result.up);
} else if (abs(result.up) > result.down) {
printf("%lld %lld/%lld", result.up / result.down, abs(result.up) % result.down, result.down);
} else {
printf("%lld/%lld", result.up, result.down);
}
if (result.up < 0) {
printf(")");
}
}

int main() {
char symbol[4] = {'+', '-', '*', '/'};
scanf("%lld/%lld %lld/%lld", &f1.up, &f1.down, &f2.up, &f2.down);
for (int i = 0; i < 4; ++i) {
Print(f1);
printf(" %c ", symbol[i]);
Print(f2);
printf(" = ");
if (i == 0) {
printf("\n");
} else if (i == 1) {
Print(minu(f1, f2));
printf("\n");
} else if (i == 2) {
Print(multi(f1, f2));
printf("\n");
} else {
if (f2.up == 0) {
printf("Inf");
} else {
Print(divide(f1, f2));
printf("\n");
}
}
}
return 0;
}


09-02 238

01-21 338
08-30 295
08-31 34
08-10 18
02-19 69万+
01-11
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客