1034. 有理数四则运算(20)PAT乙级&&1088. Rational Arithmetic (20)PAT甲级

甲级传送门
乙级传送门

#include<stdio.h>
#include<math.h>
#include <stdlib.h>
#include<algorithm>//加上就通过 
using namespace std;//加上就通过 

typedef long long ll;

ll gcd(ll a,ll b){
    if(a%b==0)
        return b;
    else
        return gcd(b,a%b);
}

struct Fraction{
    ll down;
    ll up;
}a,b;


Fraction reduction(Fraction f){
    if(f.down<0){
        f.up=-f.up;
        f.down=-f.down;
    }

    if(f.up==0){
        f.down=1;
    }
    else{
        int g=gcd(abs(f.up),abs(f.down));
        f.down/=g;
        f.up/=g;
    }
    return f;
}

Fraction add(Fraction a,Fraction b){
    Fraction result;
    result.down=a.down*b.down;
    result.up=a.down*b.up+a.up*b.down;
    return reduction(result);
}

Fraction minu(Fraction a,Fraction b){
    Fraction result;
    result.down=a.down*b.down;
    result.up=a.up*b.down-a.down*b.up;
    return reduction(result);
}

Fraction mul(Fraction a,Fraction b){
    Fraction result;
    result.down=a.down*b.down;
    result.up=a.up*b.up;
    return reduction(result);
}

Fraction divide(Fraction a,Fraction b){
    Fraction result;
    result.down=a.down*b.up;
    result.up=a.up*b.down;
    return reduction(result);
}


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


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(minu(a,b));
    printf("\n");

    show(a);
    printf(" * ");
    show(b);
    printf(" = ");
    show(mul(a,b));
    printf("\n");

    show(a);
    printf(" / ");
    show(b);
    printf(" = ");
    if(b.up==0)
        printf("Inf");
    else
        show(divide(a,b));
    return 0;
    //printf("\n");
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值