1088. Rational Arithmetic (20)

时间：2015-12-06 13:03:13 阅读：256 评论：0 收藏：0 [点我收藏+]

标签：

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

来源： <http://www.patest.cn/contests/pat-a-practise/1088>

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

来源： <http://www.patest.cn/contests/pat-b-practise/1034>

#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#pragma warning(disable:4996)
using namespace std;
long long int Gongyue(long long int x, long long int y) {
	long long int m = x%y;
	while (m)
	{
		x = y;
		y = m;
		m = x%y;
	}
	return y;
}
void PrintRationalNum(long long int fenzi, long long int fenmu) {
	long long int min;
	int fuhaoweizheng = 0;
	if (fenzi*fenmu >= 0)
		fuhaoweizheng = 1;
	fenzi = abs(fenzi);
	fenmu = abs(fenmu);
	if (fenzi*fenmu != 0) {
		if (fenzi <= fenmu) {
			min = Gongyue(fenmu, fenzi);
		}
		else {
			min = Gongyue(fenzi, fenmu);
		}
		fenzi /= min;
		fenmu /= min;
	}
	if (fuhaoweizheng> 0) {
		if (fenzi%fenmu == 0) {
			cout << fenzi / fenmu;
		}
		else if (abs(fenzi) > abs(fenmu)) {
			cout << fenzi / fenmu;
			cout << ‘ ‘;
			cout << abs(fenzi % fenmu);
			cout << ‘/‘;
			cout << fenmu;
		}
		else {
			cout << fenzi << "/" << fenmu;
		}
	}
	else {
		cout << "(-";
		
		if (fenzi%fenmu == 0) {
			cout << fenzi / fenmu;
		}
		else if (abs(fenzi) > abs(fenmu)) {
			cout << fenzi / fenmu;
			cout << ‘ ‘;
			cout << abs(fenzi % fenmu);
			cout << ‘/‘;
			cout << fenmu;
		}
		else {
			cout << fenzi << "/" << fenmu;
		}
		cout << ")";
	}
}
int main(void) {
	char a[50];
	string s1, s2;
	long long int fenzi1, fenmu1;
	long long int fenzi2, fenmu2;
	scanf("%s", a);
	sscanf(a, "%lld/%lld", &fenzi1, &fenmu1);
	scanf("%s", a);
	sscanf(a, "%lld/%lld", &fenzi2, &fenmu2);
	long long int min;
	if (fenzi1*fenmu1 != 0) {
		if (abs(fenzi1) <= abs(fenmu1)) {
			min = Gongyue(abs(fenmu1), abs(fenzi1));
		}
		else {
			min = Gongyue(abs(fenzi1), abs(fenmu1));
		}
		fenzi1 /= min;
		fenmu1 /= min;
	}
	if (fenzi2*fenmu2 != 0) {
		if (abs(fenzi2) <= abs(fenmu2)) {
			min = Gongyue(abs(fenmu2), abs(fenzi2));
		}
		else {
			min = Gongyue(abs(fenzi2), abs(fenmu2));
		}
		fenzi2 /= min;
		fenmu2 /= min;
	}
	long long int hefenzi, hefenmu;
	long long int chafenzi, chafenmu;
	long long int jifenzi, jifenmu;
	long long int shangfenzi, shangfenmu;
	hefenzi = fenzi1*fenmu2 + fenzi2*fenmu1;
	hefenmu = fenmu1*fenmu2;
	chafenzi = fenzi1*fenmu2 - fenzi2*fenmu1;
	chafenmu = fenmu1*fenmu2;
	jifenzi = fenzi1*fenzi2;
	jifenmu = fenmu1*fenmu2;
	PrintRationalNum(fenzi1, fenmu1);
	cout << " + ";
	PrintRationalNum(fenzi2, fenmu2);
	cout << " = ";
	PrintRationalNum(hefenzi, hefenmu);
	cout << endl;
	PrintRationalNum(fenzi1, fenmu1);
	cout << " - ";
	PrintRationalNum(fenzi2, fenmu2);
	cout << " = ";
	PrintRationalNum(chafenzi, chafenmu);
	cout << endl;
	PrintRationalNum(fenzi1, fenmu1);
	cout << " * ";
	PrintRationalNum(fenzi2, fenmu2);
	cout << " = ";
	PrintRationalNum(jifenzi, jifenmu);
	cout << endl;
	if (fenzi2 == 0) {
		PrintRationalNum(fenzi1, fenmu1);
		cout << " / ";
		PrintRationalNum(fenzi2, fenmu2);
		cout << " = Inf" << endl;
	}
	else {
		shangfenzi = fenzi1*fenmu2;
		shangfenmu = fenzi2*fenmu1;
		PrintRationalNum(fenzi1, fenmu1);
		cout << " / ";
		PrintRationalNum(fenzi2, fenmu2);
		cout << " = ";
		PrintRationalNum(shangfenzi, shangfenmu);
		cout << endl;
	}
	return 0;
}

来自为知笔记(Wiz)

1088. Rational Arithmetic (20)

标签：

原文地址：http://www.cnblogs.com/zzandliz/p/5023274.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行