1088. Rational Arithmetic (20)

#include<cstdio>
#include<algorithm>

using namespace std;
struct Fraction
{
  long long up,down;
};

long long gcd(long long a,long long b)
{
  if(b == 0) return a;
  else return gcd(b,a%b);
}
Fraction reduction(Fraction f1)
{
  if(f1.down<0)
  {
    f1.up = -f1.up;
    f1.down = -f1.down;
  }
  if(f1.up == 0)
    f1.down = 1;
  else
  {
    int x = gcd(abs(f1.up) ,abs(f1.down));
    f1.up = f1.up / x;
    f1.down = f1.down / x;

  }
  return f1;
}

//输出结果,如果是整数输出整数类型
//如果是假分数,输出整数和分数部分,否则直接输出,符号在整数前面
void show_re(Fraction f1)
{

  if(f1.up<0)
    printf("(");
  f1 = reduction(f1);
  if(f1.down == 1)
  {
    printf("%lld",f1.up);
  }
  else if(abs(f1.up) > f1.down)
  {
    printf("%lld %lld/%lld",f1.up / f1.down,abs(f1.up) % f1.down, f1.down);
  }
  else
  {

    printf("%lld/%lld",f1.up,f1.down);
  }
  if(f1.up<0)
    printf(")");
}

Fraction add(Fraction f1,Fraction f2)
{
  Fraction re;

  re.up = f1.up * f2.down + f2.up * f1.down;
  re.down = f1.down * f2.down;

  return reduction(re);
}

Fraction minu(Fraction f1,Fraction f2)
{
  Fraction re;
  re.up = f1.up * f2.down - f2.up * f1.down;
  re.down = f1.down * f2.down;

  return reduction(re);
}

Fraction multi(Fraction f1,Fraction f2)
{
  Fraction re;

  re.up = f1.up * f2.up;
  re.down = f1.down * f2.down;

  return reduction(re);
}

Fraction divide(Fraction f1,Fraction f2)
{
  Fraction re;

  re.up = f1.up * f2.down;
  re.down = f1.down * f2.up;

  return reduction(re);
}

using namespace std;
int main()
{
  int N;
  Fraction f1,f2,sum;

  scanf("%lld/%lld %lld/%lld",&f1.up,&f1.down,&f2.up,&f2.down);

  show_re(f1);
  printf(" + ");
  show_re(f2);
  printf(" = ");
  sum = add(f1,f2);
  show_re(sum);
  printf("\n");


  show_re(f1);
  printf(" - ");
  show_re(f2);
  printf(" = ");
  sum = minu(f1,f2);
  show_re(sum);
  printf("\n");

  show_re(f1);
  printf(" * ");
  show_re(f2);
  printf(" = ");
  sum = multi(f1,f2);
  show_re(sum);
  printf("\n");

  show_re(f1);
  printf(" / ");
  show_re(f2);
  printf(" = ");
  if(f2.up != 0)
  {
    sum = divide(f1,f2);
    show_re(sum);
  }
  else
  {
    printf("Inf");
  }
  printf("\n");
  return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值