本题要求编写程序,计算 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
代码:
#include<iostream>
using namespace std;
struct Fraction
{
long long int up,down;
}num[110];
int gcd(long long int a,long long int b)
{
if(b==0)
return a;
else return gcd(b,a%b);
}
long long int abs1(long long int a)
{
if(a<0)
return -a;
else
return a;
}
Fraction reduction(Fraction a)
{
if(a.down<0)
{
a.up=-a.up;
a.down=-a.down;
}
if(a.up==0)
a.down=1;
else
{
int d=gcd(abs1(a.up),abs1(a.down));
a.up/=d;
a.down/=d;
}
return a;
}
Fraction add(Fraction a,Fraction b)
{
Fraction result;
result.up=a.up*b.down+b.up*a.down;
result.down=a.down*b.down;
return result;
}
Fraction sub(Fraction a,Fraction b)
{
Fraction result;
result.up=a.up*b.down-b.up*a.down;
result.down=a.down*b.down;
return result;
}
Fraction mul(Fraction a,Fraction b)
{
Fraction result;
result.up=a.up*b.up;
result.down=a.down*b.down;
return result;
}
Fraction div(Fraction a,Fraction b)
{
Fraction result;
result.up=a.up*b.down;
result.down=a.down*b.up;
return result;
}
void show(Fraction sum)
{
if(sum.up<0)
printf("(");
if(abs1(sum.up)>sum.down)
{
printf("%lld",sum.up/sum.down);
if(abs1(sum.up)%sum.down)
printf(" %lld/%lld",abs1(sum.up)%sum.down,sum.down);
}
else if(sum.down==1)
printf("%lld",sum.up);
else
printf("%lld/%lld",sum.up,sum.down);
if(sum.up<0)
printf(")");
}
int main()
{
Fraction a,b,c;
int flag=0;
char op[4]={'+','-','*','/'};
scanf("%lld/%lld %lld/%lld",&a.up,&a.down,&b.up,&b.down);
a=reduction(a);
b=reduction(b);
for(int i=0;i<4;i++)
{
switch(i){
case 0:c=add(a,b);break;
case 1:c=sub(a,b);break;
case 2:c=mul(a,b);break;
case 3:c=div(a,b);
if(b.up==0)
flag=1;
}
c=reduction(c);
show(a);
printf(" %c ",op[i]);
show(b);
printf(" = ");
if(flag==0)
show(c);
else
printf("Inf");
printf("\n");
}
return 0;
}