1034 有理数四则运算 (20 分)

1034

分数四则运算模板

给定一个分数，一般是写成假分数比较简洁。

分数的化简

1. 如果分母的down为负数，那么令分子up和分母down都变为相反数；
2. 如果分子up为0，那么令分母down为1；
3. 约分：求出分子绝对值与分母绝对值的最大公约数d，然后令分子分母同时除以d。

struct Fraction
{
    int up,down;//分子、分母
};
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 add(Fraction f1,Fraction f2){
    Fraction result;
    result.up=f1.up*f2.down+f1.down*f2.up;
    result.down=f1.down*f2.down;
    return reduction(result);
}
Fraction minu(Fraction f1,Fraction f2){
    Fraction result;
    result.up=f1.up*f2.down-f1.down*f2.up;
    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);
}
//两个分母想乘时，最大可以达到long long，如果使用int可能会溢出
void showResult(Fraction r)
{
    r=reduction(r);
    if(r.down==1) printf("%lld",r.up);
    else if(abs(r.up)>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);
}

题解

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
//函数递归调用求最大公约数
ll gcd(ll a,ll b){
    return b==0?a:gcd(b,a%b);
}
struct Fraction
{
    ll up,down;//分子、分母
}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 add(Fraction f1,Fraction f2){
    Fraction result;
    result.up=f1.up*f2.down+f1.down*f2.up;
    result.down=f1.down*f2.down;
    return reduction(result);
}
Fraction minu(Fraction f1,Fraction f2){
    Fraction result;
    result.up=f1.up*f2.down-f1.down*f2.up;
    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);
}
void showResult(Fraction r)
{
    r=reduction(r);
    if(r.up<0) printf("(");
    if(r.down==1) printf("%lld",r.up);
    else if(abs(r.up)>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(")");
}
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;
}