1088 Rational Arithmetic （20 分)

最新推荐文章于 2021-11-23 23:34:16 发布
最新推荐文章于 2021-11-23 23:34:16 发布
阅读量179 收藏
点赞数
分类专栏： PAT (Advanced Level) Practice
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_43359312/article/details/89215112
版权

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

AC代码

#include <iostream>
#include <cstdio>
using namespace std;
long int GCD(long int x, long int y);
long int LCM(long int x, long int y);
int main() {
	long int a1, b1, a2, b2, Z1 = 0, Z2 = 0, Sign1 = 1, Sign2 = 1, Mark = 1, Flag = 1;	//Flag在整数部分为零时判断该数的正负
	long int s1 = 1, s2 = 1, s3 = 1, s4 = 1;											//Mark标志原始数是否有零
	scanf("%ld/%ld %ld/%ld", &a1, &b1, &a2, &b2);	//得到两个数
	if (a1 < 0) { a1 = -a1; Sign1 = -1; }
	else if (!a1) Mark = 0;
	if (a2 < 0) { a2 = -a2; Sign2 = -1; }	//正负问题
	else if (!a2) Mark = 0;
	if (Mark) {		//两个原始数都不为零
		long int Tmp1GCD = GCD(a1, b1);		//得到第一个数分子与分母的最大公约数
		a1 /= Tmp1GCD;
		b1 /= Tmp1GCD;		//得到第一个数的最简分数形式
		long int doa1 = a1, dob1 = b1;	//用于实际运算
		if (b1 == 1) { Z1 = a1 * Sign1; a1 = 0; }	//若分母为整数
		else if (a1 > b1) { Z1 = a1 / b1 * Sign1; a1 = a1 % b1; }	//若为假分数
		long int Tmp2GCD = GCD(a2, b2);		//得到第二个数分子与分母的最大公约数
		a2 /= Tmp2GCD;
		b2 /= Tmp2GCD;		//得到第二个数的最简分数形式
		long int doa2 = a2, dob2 = b2;	//用于实际运算
		if (b2 == 1) { Z2 = a2 * Sign2; a2 = 0; }	//若分母为整数
		else if (a2 > b2) { Z2 = a2 / b2 * Sign2; a2 = a2 % b2; }	//若为假分数
		/*-------------------原始两个数化简完毕-------------------*/
		long int retZ, reta, retb;	//最终结果的整数 分子 分母
		/*-------------------开始加法运算-------------------*/
		if ((Sign1 > 0 && Sign2 > 0) || (Sign1 < 0 && Sign2 < 0)) {
			long int Tmpb = LCM(dob1, dob2);	//得到两个分母的最小公倍数
			long int Tmpa = doa1 * (Tmpb / dob1) + doa2 * (Tmpb / dob2);
			long int TmpGCD = GCD(Tmpa, Tmpb);
			reta = Tmpa / TmpGCD;
			retb = Tmpb / TmpGCD;		//得到结果的最简分数形式
			if (retb == 1) { retZ = reta * Sign1; reta = 0; }	//若分母为整数
			else if (reta > retb) { retZ = reta / retb * Sign1; reta = reta % retb; }	//若为假分数
			else { retZ = 0; Flag = (Sign1 > 0) ? 1 : 0; }
		}
		else {	//一个正数 一个负数
			long int Tmpb = LCM(dob1, dob2);	//得到两个分母的最小公倍数
			long int Tmpa = abs(doa1 * (Tmpb / dob1) - doa2 * (Tmpb / dob2));
			long int TmpGCD = GCD(Tmpa, Tmpb);
			reta = Tmpa / TmpGCD;
			retb = Tmpb / TmpGCD;		//得到结果的最简分数形式
			if (retb == 1) { retZ = -reta; reta = 0; }	//若分母为整数
			else if (reta > retb) { retZ = -(reta / retb); reta = reta % retb; }	//若为假分数
			else { retZ = 0; Flag = 0; }
		}
		/*-------------------开始格式输出加法结果-------------------*/
		if (Z1 < 0) {	//整数部分小于零时
			if (a1) printf("(%ld %ld/%ld) + ", Z1, a1, b1);
			else printf("(%ld) + ", Z1);
		}
		else if (Z1 > 0) {	//整数部分大于零时
			if (a1) printf("%ld %ld/%ld + ", Z1, a1, b1);
			else printf("%ld + ", Z1);
		}
		else {
			if (Sign1 > 0) printf("%ld/%ld + ", a1, b1);	//整数部分为零 分数部分一定不为零
			else printf("(%ld/%ld) + ", -a1, b1);
		}
		if (Z2 < 0) {	//整数部分小于零时
			if (a2) printf("(%ld %ld/%ld) = ", Z2, a2, b2);
			else printf("(%ld) = ", Z2);
		}
		else if (Z2 > 0) {	//整数部分大于零时
			if (a2) printf("%ld %ld/%ld = ", Z2, a2, b2);
			else printf("%ld = ", Z2);
		}
		else {
			if (Sign2 > 0) printf("%ld/%ld = ", a2, b2);	//整数部分为零 分数部分一定不为零
			else printf("(%ld/%ld) = ", -a2, b2);
		}
		if (retZ < 0) {	//整数部分小于零时
			if (reta) printf("(%ld %ld/%ld)\n", retZ, reta, retb);
			else printf("(%ld)\n", retZ);
		}
		else if (retZ > 0) {	//整数部分大于零时
			if (reta) printf("%ld %ld/%ld\n", retZ, reta, retb);
			else printf("%ld\n", retZ);
		}
		else {
			if (!reta) printf("0\n");
			else {
				if (Flag) printf("%ld/%ld\n", reta, retb);
				else printf("(-%ld/%ld)\n", reta, retb);
			}
		}	//整数部分为零 分数部分一定不为零
		/*-------------------结束格式输出加法结果-------------------*/
		/*-------------------开始减法运算-------------------*/
		long int Com = 1;
		if ((Sign1 > 0 && Sign2 > 0) || (Sign1 < 0 && Sign2 < 0)) {
			long int Tmpb = LCM(dob1, dob2);	//得到两个分母的最小公倍数
			long int Tmpa = doa1 * (Tmpb / dob1) - doa2 * (Tmpb / dob2);
			if (Tmpa < 0) { Tmpa = -Tmpa; Com = -1; }	//考虑两数相减的正负
			long int TmpGCD = GCD(Tmpa, Tmpb);
			reta = Tmpa / TmpGCD;
			retb = Tmpb / TmpGCD;		//得到结果的最简分数形式
			if (retb == 1) { retZ = reta * Sign1 * Com; reta = 0; }	//若分母为整数
			else if (reta > retb) { retZ = reta / retb * Sign1 * Com; reta = reta % retb; }	//若为假分数
			else {
				retZ = 0;
				if (Sign1 * Com < 0) Flag = 0;
				else Flag = 1;
			}
		}
		else {	//一个正数 一个负数
			long int Tmpb = LCM(dob1, dob2);	//得到两个分母的最小公倍数
			long int Tmpa = doa1 * (Tmpb / dob1) + doa2 * (Tmpb / dob2);
			long int TmpGCD = GCD(Tmpa, Tmpb);
			reta = Tmpa / TmpGCD;
			retb = Tmpb / TmpGCD;		//得到结果的最简分数形式
			if (Sign1 < 0) {Com = -1; retZ = 0; Flag = 0; }	//负数减整数结果为负数
			if (retb == 1) { retZ = reta * Com; reta = 0; }	//若分母为整数
			else if (reta > retb) { retZ = reta / retb * Com; reta = reta % retb; }	//若为假分数
		}
		/*-------------------开始格式输出减法结果-------------------*/
		if (Z1 < 0) {	//整数部分小于零时
			if (a1) printf("(%ld %ld/%ld) - ", Z1, a1, b1);
			else printf("(%ld) - ", Z1);
		}
		else if (Z1 > 0) {	//整数部分大于零时
			if (a1) printf("%ld %ld/%ld - ", Z1, a1, b1);
			else printf("%ld - ", Z1);
		}
		else {
			if (Sign1 > 0) printf("%ld/%ld - ", a1, b1);	//整数部分为零 分数部分一定不为零
			else printf("(%ld/%ld) - ", -a1, b1);
		}
		if (Z2 < 0) {	//整数部分小于零时
			if (a2) printf("(%ld %ld/%ld) = ", Z2, a2, b2);
			else printf("(%ld) = ", Z2);
		}
		else if (Z2 > 0) {	//整数部分大于零时
			if (a2) printf("%ld %ld/%ld = ", Z2, a2, b2);
			else printf("%ld = ", Z2);
		}
		else {
			if (Sign2 > 0) printf("%ld/%ld = ", a2, b2);	//整数部分为零 分数部分一定不为零
			else printf("(%ld/%ld) = ", -a2, b2);
		}
		if (retZ < 0) {	//整数部分小于零时
			if (reta) printf("(%ld %ld/%ld)\n", retZ, reta, retb);
			else printf("(%ld)\n", retZ);
		}
		else if (retZ > 0) {	//整数部分大于零时
			if (reta) printf("%ld %ld/%ld\n", retZ, reta, retb);
			else printf("%ld\n", retZ);
		}
		else {
			if (!reta) printf("0\n");
			else {
				if (Flag) printf("%ld/%ld\n", reta, retb);
				else printf("(-%ld/%ld)\n", reta, retb);
			}
		}//整数部分为零 分数部分一定不为零
		/*-------------------结束格式输出减法结果-------------------*/
		/*-------------------开始乘法运算-------------------*/
		if ((Sign1 > 0 && Sign2 > 0) || (Sign1 < 0 && Sign2 < 0)) {
			long int Tmpa = doa1 * doa2;
			long int Tmpb = dob1 * dob2;
			long int TmpGCD = GCD(Tmpa, Tmpb);
			reta = Tmpa / TmpGCD;
			retb = Tmpb / TmpGCD;		//得到结果的最简分数形式
			if (retb == 1) { retZ = reta; reta = 0; }	//若分母为整数
			else if (reta > retb) { retZ = reta / retb; reta = reta % retb; }	//若为假分数
			else { retZ = 0; Flag = 1; }
		}
		else {	//一个正数 一个负数
			long int Tmpa = doa1 * doa2;
			long int Tmpb = dob1 * dob2;
			long int TmpGCD = GCD(Tmpa, Tmpb);
			reta = Tmpa / TmpGCD;
			retb = Tmpb / TmpGCD;		//得到结果的最简分数形式
			if (retb == 1) { retZ = -reta; reta = 0; }	//若分母为整数
			else if (reta > retb) { retZ = -(reta / retb); reta = reta % retb; }	//若为假分数
			else { retZ = 0; Flag = 0; }
		}
		/*-------------------开始格式输出乘法结果-------------------*/
		if (Z1 < 0) {	//整数部分小于零时
			if (a1) printf("(%ld %ld/%ld) * ", Z1, a1, b1);
			else printf("(%ld) * ", Z1);
		}
		else if (Z1 > 0) {	//整数部分大于零时
			if (a1) printf("%ld %ld/%ld * ", Z1, a1, b1);
			else printf("%ld * ", Z1);
		}
		else {
			if (Sign1 > 0) printf("%ld/%ld * ", a1, b1);	//整数部分为零 分数部分一定不为零
			else printf("(%ld/%ld) * ", -a1, b1);
		}
		if (Z2 < 0) {	//整数部分小于零时
			if (a2) printf("(%ld %ld/%ld) = ", Z2, a2, b2);
			else printf("(%ld) = ", Z2);
		}
		else if (Z2 > 0) {	//整数部分大于零时
			if (a2) printf("%ld %ld/%ld = ", Z2, a2, b2);
			else printf("%ld = ", Z2);
		}
		else {
			if (Sign2 > 0) printf("%ld/%ld = ", a2, b2);	//整数部分为零 分数部分一定不为零
			else printf("(%ld/%ld) = ", -a2, b2);
		}
		if (retZ < 0) {	//整数部分小于零时
			if (reta) printf("(%ld %ld/%ld)\n", retZ, reta, retb);
			else printf("(%ld)\n", retZ);
		}
		else if (retZ > 0) {	//整数部分大于零时
			if (reta) printf("%ld %ld/%ld\n", retZ, reta, retb);
			else printf("%ld\n", retZ);
		}
		else {
			if (Flag) printf("%ld/%ld\n", reta, retb);
			else printf("(-%ld/%ld)\n", reta, retb);
		}	//整数部分为零 分数部分一定不为零
		/*-------------------结束格式输出乘法结果-------------------*/
		/*-------------------开始除法运算-------------------*/
		if ((Sign1 > 0 && Sign2 > 0) || (Sign1 < 0 && Sign2 < 0)) {
			long int Tmpa = doa1 * dob2;	//得到分子
			long int Tmpb = dob1 * doa2;	//得到分母
			long int TmpGCD = GCD(Tmpa, Tmpb);
			reta = Tmpa / TmpGCD;
			retb = Tmpb / TmpGCD;		//得到结果的最简分数形式
			if (retb == 1) { retZ = reta; reta = 0; }	//若分母为整数
			else if (reta > retb) { retZ = reta / retb; reta = reta % retb; }	//若为假分数
			else { retZ = 0; Flag = 1; }
		}
		else {	//一个正数 一个负数
			long int Tmpa = doa1 * dob2;	//得到分子
			long int Tmpb = dob1 * doa2;	//得到分母
			long int TmpGCD = GCD(Tmpa, Tmpb);
			reta = Tmpa / TmpGCD;
			retb = Tmpb / TmpGCD;		//得到结果的最简分数形式
			if (retb == 1) { retZ = -reta; reta = 0; }	//若分母为整数
			else if (reta > retb) { retZ = -(reta / retb); reta = reta % retb; }	//若为假分数
			else { retZ = 0; Flag = 0; }
		}
		/*-------------------开始格式输出除法结果-------------------*/
		if (Z1 < 0) {	//整数部分小于零时
			if (a1) printf("(%ld %ld/%ld) / ", Z1, a1, b1);
			else printf("(%ld) / ", Z1);
		}
		else if (Z1 > 0) {	//整数部分大于零时
			if (a1) printf("%ld %ld/%ld / ", Z1, a1, b1);
			else printf("%ld / ", Z1);
		}
		else {
			if (Sign1 > 0) printf("%ld/%ld / ", a1, b1);	//整数部分为零 分数部分一定不为零
			else printf("(%ld/%ld) / ", -a1, b1);
		}
		if (Z2 < 0) {	//整数部分小于零时
			if (a2) printf("(%ld %ld/%ld) = ", Z2, a2, b2);
			else printf("(%ld) = ", Z2);
		}
		else if (Z2 > 0) {	//整数部分大于零时
			if (a2) printf("%ld %ld/%ld = ", Z2, a2, b2);
			else printf("%ld = ", Z2);
		}
		else {
			if (Sign2 > 0) printf("%ld/%ld = ", a2, b2);	//整数部分为零 分数部分一定不为零
			else printf("(%ld/%ld) = ", -a2, b2);
		}
		if (retZ < 0) {	//整数部分小于零时
			if (reta) printf("(%ld %ld/%ld)\n", retZ, reta, retb);
			else printf("(%ld)\n", retZ);
		}
		else if (retZ > 0) {	//整数部分大于零时
			if (reta) printf("%ld %ld/%ld\n", retZ, reta, retb);
			else printf("%ld\n", retZ);
		}
		else {
			if (Flag) printf("%ld/%ld\n", reta, retb);
			else printf("(-%ld/%ld)\n", reta, retb);
		}//整数部分为零 分数部分一定不为零
		/*-------------------结束格式输出除法结果-------------------*/
	}
	else {	//两个原始数至少有一个为零
		if (a1 && !a2) {	//第二个数为零
			long int Tmp1GCD = GCD(a1, b1);		//得到第一个数分子与分母的最大公约数
			a1 /= Tmp1GCD;
			b1 /= Tmp1GCD;		//得到第一个数的最简分数形式
			long int doa1 = a1, dob1 = b1;	//用于实际运算
			if (b1 == 1) { Z1 = a1 * Sign1; a1 = 0; }	//若分母为整数
			else if (a1 > b1) { Z1 = a1 / b1 * Sign1; a1 = a1 % b1; }	//若为假分数
			if (Z1 < 0) {	//整数部分小于零时
				if (a1) {
					printf("(%ld %ld/%ld) + 0 = (%ld %ld/%ld)\n", Z1, a1, b1, Z1, a1, b1);
					printf("(%ld %ld/%ld) - 0 = (%ld %ld/%ld)\n", Z1, a1, b1, Z1, a1, b1);
					printf("(%ld %ld/%ld) * 0 = 0\n", Z1, a1, b1); s3 = 0;
					printf("(%ld %ld/%ld) / 0 = Inf\n", Z1, a1, b1); s4 = 0;
				}
				else {
					printf("(%ld) + 0 = (%ld)\n", Z1, Z1); s1 = 0;
					printf("(%ld) - 0 = (%ld)\n", Z1, Z1); s2 = 0;
					printf("(%ld) * 0 = 0\n", Z1); s3 = 0;
					printf("(%ld) / 0 = Inf\n", Z1); s4 = 0;
				}
			}
			else if (Z1 > 0) {	//整数部分大于零时
				if (a1) {
					printf("%ld %ld/%ld + 0 = %ld %ld/%ld\n", Z1, a1, b1, Z1, a1, b1);
					printf("%ld %ld/%ld - 0 = %ld %ld/%ld\n", Z1, a1, b1, Z1, a1, b1);
					printf("%ld %ld/%ld * 0 = 0\n", Z1, a1, b1);
					printf("%ld %ld/%ld / 0 = Inf\n", Z1, a1, b1);
				}
				else {
					printf("%ld + 0 = %ld\n", Z1, Z1);
					printf("%ld - 0 = %ld\n", Z1, Z1);
					printf("%ld * 0 = 0\n", Z1);
					printf("%ld / 0 = Inf\n", Z1);
				}
			}
			else {
				printf("%ld/%ld + 0 = %ld/%ld\n", a1, b1, a1, b1);	//整数部分为零 分数部分一定不为零
				printf("%ld/%ld - 0 = %ld/%ld\n", a1, b1, a1, b1);	//整数部分为零 分数部分一定不为零
				printf("%ld/%ld * 0 = 0\n", a1, b1);	//整数部分为零 分数部分一定不为零
				printf("%ld/%ld / 0 = Inf\n", a1, b1);	//整数部分为零 分数部分一定不为零
			}
		}
		else if (!a1 && a2) {	//第一个数为零
			long int Tmp2GCD = GCD(a2, b2);		//得到第二个数分子与分母的最大公约数
			a2 /= Tmp2GCD;
			b2 /= Tmp2GCD;		//得到第二个数的最简分数形式
			long int doa2 = a2, dob2 = b2;	//用于实际运算
			if (b2 == 1) { Z2 = a2 * Sign2; a2 = 0; }	//若分母为整数
			else if (a2 > b2) { Z2 = a2 / b2 * Sign2; a2 = a2 % b2; }	//若为假分数
			if (Z2 < 0) {	//整数部分小于零时
				if (a2) {
					printf("0 + (%ld %ld/%ld) = (%ld %ld/%ld)\n", Z2, a2, b2, Z2, a2, b2);
					printf("0 - (%ld %ld/%ld) = %ld %ld/%ld\n", Z2, a2, b2, -Z2, a2, b2);
					printf("0 * (%ld %ld/%ld) = 0\n", Z2, a2, b2);
					printf("0 / (%ld %ld/%ld) = 0\n", Z2, a2, b2);
				}
				else {
					printf("0 + (%ld) = (%ld)\n", Z2, Z2);
					printf("0 - (%ld) = %ld\n", Z2, -Z2);
					printf("0 * (%ld) = 0\n", Z2);
					printf("0 / (%ld) = 0\n", Z2);
				}
			}
			else if (Z2 > 0) {	//整数部分大于零时
				if (a2) {
					printf("0 + %ld %ld/%ld = %ld %ld/%ld\n", Z2, a2, b2, Z2, a2, b2);
					printf("0 - %ld %ld/%ld = (%ld %ld/%ld\n)", Z2, a2, b2, -Z2, a2, b2);
					printf("0 * %ld %ld/%ld = 0\n", Z2, a2, b2);
					printf("0 / %ld %ld/%ld = 0\n", Z2, a2, b2);
				}
				else {
					printf("0 + %ld = %ld\n", Z2, Z2);
					printf("0 - %ld = (%ld)\n", Z2, -Z2);
					printf("0 * %ld = 0\n", Z2);
					printf("0 / %ld = 0\n", Z2);
				}
			}
			else {
				printf("0 + %ld/%ld = %ld/%ld\n", a2, b2, a2, b2);	//整数部分为零 分数部分一定不为零
				printf("0 - %ld/%ld = (-%ld/%ld)\n", a2, b2, a2, b2);	//整数部分为零 分数部分一定不为零
				printf("0 * %ld/%ld = 0\n", a2, b2);	//整数部分为零 分数部分一定不为零
				printf("0 / %ld/%ld = 0\n", a2, b2);	//整数部分为零 分数部分一定不为零
			}
		}
		else {
			printf("0 + 0 = 0\n");	//两个数都是零
			printf("0 - 0 = 0\n");	//两个数都是零
			printf("0 * 0 = 0\n");	//两个数都是零
			printf("0 / 0 = Inf\n");	//两个数都是零
		}
	}
	return 0;
}
long int GCD(long int x, long int y) {
	return (!y) ? x : GCD(y, x % y);
}
long int LCM(long int x, long int y) {
	return x * y / GCD(x, y);
}
Yo3ngLau
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
专栏目录
个人练习-PAT甲级-1088 Rational Arithmetic
Rstln的博客
09-12 109
题目链接https://pintia.cn/problem-sets/994805342720868352/problems/994805378443755520 不难，但是细节有些多要注意。 用到的分数类，分为整数部分、分子、分母 class Node { public: long int part1, a, b; }; 首先写好输出函数，输入一个假分数，输出带分数，负数时要带括号。 （1）为零的话只需输出零，我们统一在带分数部分输出这个零，即整数部分为零的话不输出； （2）仅有整数部分或仅有分
1088 Rational Arithmetic (20分)
ZiYuTongXue的博客
06-15 247
这个题目关键是写一个化简函数，测试点3和4考察的是 对负数的处理 测试点4不能用 a*b<0判断 负数，因为会溢出。 测试点3就是分母为负数的情况。 附本人AC代码： #include<iostream> #include<string> #include<math.h> using namespace std; long long gcd(long long A, long long B) { return B == 0 ? A : gcd(B,A%B); }
PAT甲级1088 Rational Arithmetic
weixin_44535077的博客
11-23 338
1088 牛客网 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 nu
PAT 甲级 1088  Rational Arithmetic
漫浸天空的雨色的备忘录~
02-13 454
1088 Rational Arithmetic （20 point(s)） For two rational numbers, your task is to implement the basic arithmetics, that is, to calculate their sum, difference, product and quotient. Input Specificati...
1088 Rational Arithmetic（20 分）
程序人生
08-29 698
思路：分数计算 注意：输出初始的分数的时候也要化成最简形式。 #include&lt;iostream&gt; #include&lt;vector&gt; #include&lt;cstring&gt; #include&lt;string&gt; #include&lt;map&gt; #include&lt;algorithm&gt; #include&lt;ctime&gt; us
Rational Numbers
03-20
(Rational Numbers) Create a class called Rational for performing arithmetic with fractions. Write a program to test your class. Use integer variables to represent the private instance variables of the...
分数的加减乘除运算Rational Numbers
03-21
8.17 (Rational Numbers) Create a class called Rational for performing arithmetic with fractions. Write a program to test your class. Use integer variables to represent the private instance variables ...
new--miracl
12-24
The Zipped archive MIRACL.ZIP contains all the source code for the latest version of MIRACL: a Multiprecision Integer and Rational Arithmetic C/C++ library. The full Manual is available in both MS ...
小学数学英语单词汇总带音标分类.doc
09-25
- **有理数/数字/数**: rational['ræʃ(ə)n(ə)l] number, digit['dɪdʒɪt], number - **自然数/整数/小数/分数**: natural['nætʃ(ə)r(ə)l] number, integer ['ɪntɪdʒə], decimal ['desɪm(ə)l], ...
Algebraic Functions
09-16
The distinguishing feature of the book is its third chapter, on rational functions, which gives an extremely brief and clear account of the theory of divisors. Here the integrands of the three ...
1088 Rational Arithmetic (20分) 思路分析 测试点分析（解决你的测试点过不了）
weixin_43725617的博客
06-08 656
题目 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 i
PAT A 1088 Rational Arithmetic (20 分)
Siumai's Blog
08-25 313
### 一、思路 构造输出函数，格式化输出分数： 1、分子或分母为零，输出0或Inf且不再进行其他处理 2、若分子分母均非零，将格式统一为分子分母均为正数，符号单独存储输出 3、输出分数： （1）若有整数部分，输出整数 （2）若有整数部分且有分数部分，输出空格 （3）若有分数部分，输出分数 ```python void output(long long a, long long b) { if( !b || !a ) { printf("%s", !b ? "Inf":"0"); return
长整型打印（%ld）%d错误
Zhao_Eagle的博客
01-18 2936
一、问题 运行下面这串代码是出现以下警告 long num = 100; printf("%d\n",num); ``format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long int’ [-Wformat=] 二、解决 改成 printf("%ld\n",num) 完美解决 三、总结 长整型用 %ld 来打印 整形用 %d 来打印 希望下次记住，别再犯同样的错误！！！ ...
1088 Rational Arithmetic (20 分)
shshbdhsjjd的博客
03-02 79
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 li
【PAT甲级】1088 Rational Arithmetic（20 分）
feng_zhiyu的博客
09-03 325
题目链接 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 ...
A1088 Rational Arithmetic (20 分)
资资的博客
03-16 105
#include <bits/stdc++.h> using namespace std; typedef long long ll; struct Fraction { ll up; ll down; }; ll gcd(ll a,ll b) { if(b==0) return a; return gcd(b,a%b); } Fraction reduction(Fraction a) { if(a.down < 0) .
1088. Rational Arithmetic (20)解题报告
信道者
12-28 347
//我使用了C++的类和运算符重载#include #include #include #define N 1000 /* run this program using the console pauser or add your own getch, system("pause") or input loop */ bool cmp(int arr1[], int arr2[], int
rational arithmetic
最新发布
03-16
有理算术（rational arithmetic）是指涉及有理数的基本算术运算，包括加、减、乘、除等。有理数是可以表示为两个整数之比的数，例如1/2、3/4等。在有理算术中，我们可以对有理数进行加减乘除等运算，得到新的有理数...
评论 1
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值