PAT(甲级)1088

1088. Rational Arithmetic (20)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

#include <iostream>

using namespace std;
///
//where is the bug?????????????????
//
//MD  numerator is long type, but when scanf("%d.......FUCKKKKK!
//FUCK!!! IT SAID THE DENOMINATOR OF INPUT DATA IS NON-ZERO,BUT IT ATE ITS WORDS!!!!

long long mygcd(long long a,long long b){
	if(a < 0)
	    a = -a;
	if(a < b){                  //
		long long tmp =b;
		b=a;
		a= tmp;
	}
	long long tmp = b%a;
	while(tmp){
		b= a;
		a= tmp;
		tmp = b%a;
	}
	return a;
}

void display(long long a,long long b){             //this function is correct!!
    if(b == 0 )
        cout <<"Inf";
	else if(b == 1 ){          //integer
		if(a >=0)
		    cout <<a;
		else{
			cout <<"(" <<a <<")";
		}
	}
	else if(a <0){  //negtive
		cout <<"(";
		if(-a > b){
			cout <<a/b <<' ' <<-a%b <<'/' <<b <<")";
		}
		else
		    cout <<a <<'/' <<b <<")";  
	}else{  //possitive
		if(a > b )
		    cout <<a/b <<' ';
		cout <<a%b  <<'/' <<b;
	}
	return ;
}

void add(long long numerator1,long long denominator1,long long numerator2,long long denominator2){
	display(numerator1,denominator1);
	cout <<" + ";
	display(numerator2,denominator2);
	cout <<" = ";
	numerator1= numerator1*denominator2+numerator2*denominator1;
	denominator1 = denominator1*denominator2;
	if(numerator1 !=0){
	    long long factor = mygcd(numerator1,denominator1);
    	numerator1 /=factor;
    	denominator1 /=factor;
	}else                  //the result is zero
	    denominator1 =1;
	display(numerator1,denominator1);	
	cout <<endl;
}

void sub(long long numerator1,long long denominator1,long long numerator2,long long denominator2){
	display(numerator1,denominator1);
	cout <<" - ";
	display(numerator2,denominator2);
	cout <<" = ";
	numerator1= numerator1*denominator2-numerator2*denominator1;
	denominator1 = denominator1*denominator2;
	if(numerator1 !=0){
	    long long factor = mygcd(numerator1,denominator1);
    	numerator1 /=factor;
    	denominator1 /=factor;
	}else               //the result is zero
	    denominator1 =1;
	display(numerator1,denominator1);
	cout <<endl;
}

void mul(long long numerator1,long long denominator1,long long numerator2,long long denominator2){
	display(numerator1,denominator1);
	cout <<" * ";
	display(numerator2,denominator2);
	cout <<" = ";
	numerator1= numerator1*numerator2;
	denominator1 = denominator1*denominator2;
	if(numerator1 !=0){
	    long long factor = mygcd(numerator1,denominator1);
    	numerator1 /=factor;
    	denominator1 /=factor;
	}else                 //the result is zero
	    denominator1 =1;
	display(numerator1,denominator1);
	cout <<endl;
}

void did(long long numerator1,long long denominator1,long long numerator2,long long denominator2){
	display(numerator1,denominator1);
	cout <<" / ";
	display(numerator2,denominator2);
	cout <<" = ";
	numerator1= numerator1*denominator2;
	denominator1 = denominator1*numerator2;
	if(numerator1 !=0 && denominator1 !=0 ){
	    long long factor = mygcd(numerator1,denominator1);
    	numerator1 /=factor;
    	denominator1 /=factor;
    	if(denominator1 < 0){            //make sure denominator is possitive
    		denominator1 =-denominator1;
    		numerator1 =-numerator1;
		}
	}else if(numerator1 == 0 && denominator1 != 0)
	    denominator1 =1;
	display(numerator1,denominator1);
	cout <<endl;
}

int main()
{
	long long numerator,numerator1,numerator2;
	long long denominator,denominator1,denominator2;
	scanf("%lld/%lld %lld/%lld",&numerator1,&denominator1,&numerator2,&denominator2);
	if(numerator1 !=0 && denominator!= 0 ){
		long long factor = mygcd(numerator1,denominator1);
		numerator1 /=factor;
		denominator1 /=factor;
	}else if(numerator1 == 0&& denominator1 !=0)
	    denominator1 = 1;
	if(numerator2 != 0 &&denominator2 !=0){
		long long factor = mygcd(numerator2,denominator2);
		numerator2 /=factor;
		denominator2 /=factor;
	}else if(numerator2==0 &&denominator2 !=0)
	    denominator2 =1;
	add(numerator1,denominator1,numerator2,denominator2);
	sub(numerator1,denominator1,numerator2,denominator2);
	mul(numerator1,denominator1,numerator2,denominator2);
	did(numerator1,denominator1,numerator2,denominator2);
	return 0;
}