#include<stdio.h>
#include<stdlib.h>
struct fra
{
long long up;
long long down;
}a,b,c;
long long gcd(long long a,long long b);
fra huajian(fra a);
fra add(fra a,fra b);
fra div(fra a,fra b);
fra mul(fra a,fra b);
fra did(fra a,fra b);
void show(fra a);
int main()
{
scanf("%lld/%lld %lld/%lld",&a.up,&a.down,&b.up,&b.down);
show(a);
printf(" + ");
show(b);
printf(" = ");
show(add(a,b));
printf("\n");
show(a);
printf(" - ");
show(b);
printf(" = ");
show(div(a,b));
printf("\n");
show(a);
printf(" * ");
show(b);
printf(" = ");
show(mul(a,b));
printf("\n");
show(a);
printf(" / ");
show(b);
printf(" = ");
if(huajian(b).up==0)
printf("Inf");
else
show(did(a,b));
printf("\n");
return 0;
}
void show(fra a)
{
a=huajian(a);
if(a.up<0)
printf("(");
if(a.down==1)
printf("%lld",a.up);
else if(abs(a.up)>abs(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,a.down);
if(a.up<0)
printf(")");
}
long long gcd(long long a,long long b)
{
a=abs(a);
b=abs(b);
if(b==0) return a;
else return gcd(b,a%b);
}
fra huajian(fra a)
{
long long temp=gcd(a.up,a.down);
if(a.down<0)
{
a.up*=(-1);
a.down*=(-1);
}
if(a.up==0)
a.down=1;
else
{
a.up/=temp;
a.down/=temp;
}
return a;
}
fra add(fra a,fra b)
{
c.up=a.up*b.down+a.down*b.up;
c.down=a.down*b.down;
return huajian(c);
}
fra div(fra a,fra b)
{
c.up=a.up*b.down-a.down*b.up;
c.down=a.down*b.down;
return huajian(c);
}
fra mul(fra a,fra b)
{
c.up=a.up*b.up;
c.down=a.down*b.down;
return huajian(c);
}
fra did(fra a,fra b)
{
c.up=a.up*b.down;
c.down=a.down*b.up;
return huajian(c);
}
1034 有理数四则运算 (20 分)
最新推荐文章于 2022-11-16 13:20:07 发布