PAT-BASIC1034——有理数四则运算/PAT-ADVANCED1088——Rational Arithmetic

我的PAT-BASIC代码仓：https://github.com/617076674/PAT-BASIC

我的PAT-ADVANCED代码仓：https://github.com/617076674/PAT-ADVANCED

原题链接：

PAT-BASIC1034：https://pintia.cn/problem-sets/994805260223102976/problems/994805287624491008

PAT-ADVANCED1088：https://pintia.cn/problem-sets/994805342720868352/problems/994805378443755520

题目描述：

PAT-BASIC1034：

PAT-ADVANCED1088：

知识点：欧几里得算法求最大公约数

思路：按题述进行编程即可

欧几里得算法求最大公约数是本题的核心知识点，其伪码如下：

int gcd(int a, int b) {
    if(b == 0) {
        return a;
    }
    return gcd(b, a % b);
}

其中的a和b为非负数，且满足a >= b。

本题思路清晰，但是需要注意的细节很多：

（1）负数显示时需要增加括号。

（2）除数是0时需要特殊处理。

（3）乘法和加法会导致int型数据越界，需用long型数据处理。这一点，题目里又在疯狂暗示——“题目保证正确的输出中没有超过整型范围的整数”。和PAT-BASIC1033——旧键盘打字中的暗示有异曲同工之妙。

C++代码：

#include<iostream>

using namespace std;

long long numerator1, numerator2, denominator1, denominator2, newDenominator, newNumerator;

long long gcd(long long num1, long long num2);
void showFraction(long long numerator, long long denominator);
void showResults(long long numerator1, long long numerator2, long long denominator1, long long denominator2, char c);

int main() {
	scanf("%lld/%lld %lld/%lld", &numerator1, &denominator1, &numerator2, &denominator2); 
	showResults(numerator1, numerator2, denominator1, denominator2, '+');
	printf("\n");
	showResults(numerator1, numerator2, denominator1, denominator2, '-');
	printf("\n");
	showResults(numerator1, numerator2, denominator1, denominator2, '*');
	printf("\n");
	showResults(numerator1, numerator2, denominator1, denominator2, '/');
	printf("\n");
	return 0;
}

long long gcd(long long num1, long long num2){
	if(num1 < num2){
		long long temp = num1;
		num1 = num2;
		num2 = temp;
	}
	if(num2 == 0)
        return num1;
    return gcd(num2, num1 % num2);
}

void showFraction(long long numerator, long long denominator){
	bool flag = false;
	if(numerator < 0){
		numerator *= -1;
		flag = true;
	}
	if(flag) {
		printf("(");
	}
	if(numerator % denominator == 0) {
		if(flag){
			printf("-");
		}
		printf("%lld", numerator / denominator);
	} else {
		long long maxGCD = gcd(numerator, denominator);
		if(flag){
			printf("-");
		}
		if(numerator < denominator){
			printf("%lld/%lld", numerator / maxGCD, denominator / maxGCD);
		}else{
			long long merchant = numerator / denominator;
			printf("%lld %lld/%lld", merchant, (numerator - merchant * denominator) / maxGCD, denominator / maxGCD);
		}	
	}
	if(flag) {
		printf(")");
	}
}

void showResults(long long numerator1, long long numerator2, long long denominator1, long long denominator2, char c) {
	showFraction(numerator1, denominator1);
	printf(" %c ", c); 
	showFraction(numerator2, denominator2);
	printf(" = ");
	if(c == '+') {
		newDenominator = denominator1 * denominator2;
		newNumerator = numerator1 * denominator2 + numerator2 * denominator1;
		showFraction(newNumerator, newDenominator);
	}else if(c == '-'){
		newDenominator = denominator1 * denominator2;
		newNumerator = numerator1 * denominator2 - numerator2 * denominator1;
		showFraction(newNumerator, newDenominator);
	}else if(c == '*'){
		newDenominator = denominator1 * denominator2;
		newNumerator = numerator1 * numerator2;
		showFraction(newNumerator, newDenominator);
	}else if(c == '/'){
		newDenominator = denominator1 * numerator2;
		newNumerator = numerator1 * denominator2;
		if(newDenominator < 0){
			newNumerator *= -1;
			newDenominator *= -1;
		}
		if(newDenominator == 0){
			printf("Inf");
		}else{
			showFraction(newNumerator, newDenominator);
		}
	}
}

C++解题报告：