1034_有理数四则运算

1034 有理数四则运算（20 分）

本题要求编写程序，计算 2 个有理数的和、差、积、商。

输入格式：

输入在一行中按照 a1/b1 a2/b2 的格式给出两个分数形式的有理数，其中分子和分母全是整型范围内的整数，负号只可能出现在分子前，分母不为 0。

输出格式：

分别在 4 行中按照 有理数1 运算符 有理数2 = 结果 的格式顺序输出 2 个有理数的和、差、积、商。注意输出的每个有理数必须是该有理数的最简形式 k a/b，其中 k 是整数部分，a/b 是最简分数部分；若为负数，则须加括号；若除法分母为 0，则输出 Inf。题目保证正确的输出中没有超过整型范围的整数。

输入样例 1：

1

2/3 -4/2

输出样例 1：

1 2 3 4

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

输入样例 2：

1

5/3 0/6

输出样例 2：

1 2 3 4

1 2/3 + 0 = 1 2/3 1 2/3 - 0 = 1 2/3 1 2/3 * 0 = 0 1 2/3 / 0 = Inf

代码实现:

这个是算法笔记上面的代码,思路非常清晰.但是略繁琐.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101

#include<iostream> #include<string> #include<algorithm> using namespace std; typedef long long ll; ll gcd(ll a, ll b){ return !b ? a : gcd(b, a%b); } struct Fraction{ ll up, down; }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{//分子不为零进行约分 int 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 showResult(Fraction r){ r = reduction(r); if (r.up < 0) printf("("); if (r.down == 1) printf("%lld", r.up); else if (abs(r.up)>r.down){ printf("%lld %lld/%lld", r.up / r.down, abs(r.up) % r.down, r.down); } else{ printf("%lld/%lld", r.up, r.down); } if (r.up < 0) printf(")"); } int main(){ scanf("%lld/%lld %lld/%lld", &a.up, &a.down, &b.up, &b.down); //加法 showResult(a); printf(" + "); showResult(b); printf(" = "); showResult(add(a, b)); printf("\n"); //减法 showResult(a); printf(" - "); showResult(b); printf(" = "); showResult(minu(a, b)); printf("\n"); //乘法 showResult(a); printf(" * "); showResult(b); printf(" = "); showResult(multi(a, b)); printf("\n"); //除法 showResult(a); printf(" / "); showResult(b); printf(" = "); if (b.up == 0) printf("Inf"); else showResult(divide(a, b)); printf("\n"); return 0; }

以下这是柳婼的代码,其中的flag用的很巧妙.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58

#include <iostream> #include <cmath> using namespace std; long long a, b, c, d; long long gcd(long long t1, long long t2) { return t2 == 0 ? t1 : gcd(t2, t1 % t2); } void func(long long m, long long n) { int flag1 = 0, flag2 = 0, flag = 0; if (n == 0) { printf("Inf"); return; } if (m == 0) { printf("0"); return; } if (m < 0) flag1 = 1; if (n < 0) flag2 = 1; m = abs(m), n = abs(n); if (flag1 == 1 && flag2 == 1) flag = 0; else if (flag1 == 1 || flag2 == 1) flag = 1; if (m == n) { if (flag == 1) printf("(-1)"); else printf("1"); return; } long long x = m % n, y = m / n; if (x == 0) { if (flag == 0) printf("%d", y); else printf("(-%d)", y); return; } else { long long t1 = m - y * n, t2 = n, t = gcd(t1, t2); t1 = t1 / t, t2 = t2 / t; if (flag == 1) { printf("(-"); if (y != 0) printf("%lld %lld/%lld)", y, t1, t2); else printf("%d/%d)", t1, t2); } else { if (y != 0) printf("%lld %lld/%lld", y, t1, t2); else printf("%lld/%lld", t1, t2); } } } void print() { func(a, b); printf(" + "); func(c, d); printf(" = "); func(a * d + b * c, b * d); printf("\n"); func(a, b); printf(" - "); func(c, d); printf(" = "); func(a * d - b * c, b * d); printf("\n"); func(a, b); printf(" * "); func(c, d); printf(" = "); func(a * c, b * d); printf("\n"); func(a, b); printf(" / "); func(c, d); printf(" = "); func(a * d, b * c); printf("\n"); } int main() { scanf("%lld/%lld %lld/%lld", &a, &b, &c, &d); print(); return 0; }

个人思考:

这道题看似不难,但是要是仔细做的话又太繁琐了.很难处理好其中的细节,第一份代码思路很好,虽然长了点,但是思路清晰啊,我觉得可以用这个学习.pat以后的题目真的是越来越考验复杂问题的处理了.