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
思路:
做分数的四则运算。
注意分母为1,只输出分子。除数不能为0。
C++:
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
struct Fraction{
ll up;//分子
ll down;//分母
}c,d;
//最大公约数
ll gcd(ll a,ll b){
return !b?a:gcd(b,a%b);
}
//化简
Fraction reduction(Fraction a){
//分母小于0
if(a.down<0){
a.up=-a.up;
a.down=-a.down;
}
//约分
if(a.up==0){a.down=1;}
else{
int b=gcd(abs(a.up),abs(a.down));
a.up/=b;
a.down/=b;
}
return a;
}
//分数加法
Fraction add(Fraction f1,Fraction f2){
Fraction result;
result.up=f1.up*f2.down+f1.down*f2.up;//分子
result.down=f1.down*f2.down;//分母
return reduction(result);
}
//分数减法
Fraction minu(Fraction f1,Fraction f2){
Fraction result;
result.up=f1.up*f2.down-f1.down*f2.up;
result.down=f1.down*f2.down;
return reduction(result);
}
//分数乘法
Fraction mult(Fraction f1,Fraction f2){
Fraction result;
result.up=f1.up*f2.up;
result.down=f1.down*f2.down;
return reduction(result);
}
//分数除法
Fraction div(Fraction f1,Fraction f2){
Fraction result;
result.up=f1.up*f2.down;
result.down=f1.down*f2.up;
return reduction(result);
}
//显示分数
void showResult(Fraction a){
a=reduction(a);
if(a.up<0)printf("(");
if(a.down==1)printf("%lld",a.up);
else if(abs(a.up)>a.down){
printf("%lld %lld/%lld",a.up/a.down,abs(a.up)%a.down,a.down);
}else{
printf("%lld/%lld",a.up,a.down);
}
if(a.up<0)printf(")");
}
int main(){
scanf("%lld/%lld %lld/%lld",&c.up,&c.down,&d.up,&d.down);
//加法
showResult(c);
printf(" + ");
showResult(d);
printf(" = ");
showResult(add(c,d));
printf("\n");
//减法
showResult(c);
printf(" - ");
showResult(d);
printf(" = ");
showResult(minu(c,d));
printf("\n");
//乘法
showResult(c);
printf(" * ");
showResult(d);
printf(" = ");
showResult(mult(c,d));
printf("\n");
//除法
showResult(c);
printf(" / ");
showResult(d);
printf(" = ");
if(d.up==0)printf("Inf");
else showResult(div(c,d));
return 0;
}