#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
struct Fraction
{
ll up,down;
}a,b;
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
}
Fraction reduction(Fraction result)
{
if(result.down<0)
{
result.up=-result.up;
result.down=-result.down;
}
if(result.up==0) result.down=1;
else
{
int d=gcd(abs(result.up),abs(result.down));
result.up/=d;
result.down/=d;
}
return result;
}
Fraction showResult(Fraction r)
{
r=reduction(r);
if(r.up<0) printf("(");
if(r.down==1) printf("%lld",r.up);
else if(abs(r.up)>abs(r.down)) printf("%lld %lld/%lld",r.up/r.down,abs(r.up)%r.down,r.down);
else printf("%lld/%lld",r.up,r.down);
if(r.up<0) printf(")");
}
Fraction add(Fraction f1,Fraction f2)
{
Fraction result;
result.up=f1.up*f2.down+f2.up*f1.down;
result.down=f1.down*f2.down;
return reduction(result);
}
Fraction minu(Fraction f1,Fraction f2)
{
Fraction result;
result.up=f1.up*f2.down-f2.up*f1.down;
result.down=f1.down*f2.down;
return reduction(result);
}
Fraction multi(Fraction f1,Fraction f2)
{
Fraction result;
result.up=f1.up*f2.up;
result.down=f1.down*f2.down;
return reduction(result);
}
Fraction divide(Fraction f1,Fraction f2)
{
Fraction result;
result.up=f1.up*f2.down;
result.down=f1.down*f2.up;
return reduction(result);
}
int main()
{
scanf("%lld/%lld %lld/%lld",&a.up,&a.down,&b.up,&b.down);
showResult(a);
printf(" + ");
showResult(b);
printf(" = ");
showResult(add(a,b));
printf("\n");
showResult(a);
printf(" - ");
showResult(b);
printf(" = ");
showResult(minu(a,b));
printf("\n");
showResult(a);
printf(" * ");
showResult(b);
printf(" = ");
showResult(multi(a,b));
printf("\n");
showResult(a);
printf(" / ");
showResult(b);
printf(" = ");
if(b.up==0) printf("INF");
else showResult(divide(a,b));
return 0;
}
B1034/A1088 Rational Arithmetic
最新推荐文章于 2022-10-20 15:21:55 发布