用LUA(和C++)刷PAT (Advanced Level) ——1088 Rational Arithmetic

#include <iostream>
#include <string>
#include <cmath>

using namespace std;

long int realGetMaxFaction(long int a, long int b){
    if (a == 0)
        return b;    
    if (b == 0)
        return a;
    if (a > b)
        return realGetMaxFaction(a % b, b);
    return realGetMaxFaction(a, b % a);
}

long int getMaxFaction(long int a, long int b)
{
    a = max(a, -a);
    b = max(b, -b);
    if (a == 0 || b == 0)
        return 1;
    
    return realGetMaxFaction(a, b);
}

string format(long int a, long int b){
    if(a == 0)
        return "0";
    if(b == 0)
        return "Inf";
    string ret = "";
    long int integer;
    if (a < 0)
        integer = ceil(a / b);
    else
        integer = floor(a / b);
    a -= b * integer;
    if (integer != 0)
        a = max(a, -a);
    if (integer != 0)
        ret += to_string(integer);
    if (integer != 0 && a != 0)
        ret += " ";
    if (a != 0)
        ret += to_string(a) + "/" + to_string(b);
    if (a < 0 || integer < 0)
        ret = "(" + ret + ")";
    return ret;
}

int main()
{
    long int a1, b1, a2, b2;
    char c;
    long int res_a, res_b, max_faction = 1;
    cin>>a1>>c>>b1>>a2>>c>>b2;
    max_faction = getMaxFaction(a1, b1);
    a1 /= max_faction;
    b1 /= max_faction;
    max_faction = getMaxFaction(a2, b2);
    a2 /= max_faction;
    b2 /= max_faction;
    string s1, s2;
    s1 = format(a1, b1);
    s2 = format(a2, b2);
    
    //add;
    max_faction = getMaxFaction(b1, b2);
    res_a = b2 / max_faction * a1 + b1 / max_faction * a2;
    res_b = b1 / max_faction * b2;
    max_faction = getMaxFaction(res_a, res_b);
    res_a /= max_faction;
    res_b /= max_faction;
    cout<<s1<< " + " << s2<<" = "<<format(res_a, res_b) <<endl;
    
    //sub;
    max_faction = getMaxFaction(b1, b2);
    res_a = b2 / max_faction * a1 - b1 / max_faction * a2;
    res_b = b1 / max_faction * b2;
    max_faction = getMaxFaction(res_a, res_b);
    res_a /= max_faction;
    res_b /= max_faction;
    cout<<s1<< " - " << s2<<" = "<<format(res_a, res_b) <<endl;
    
    //mul;
    max_faction = getMaxFaction(a1, b2);
    res_a = a1 / max_faction;
    res_b = b2 / max_faction;
    max_faction = getMaxFaction(a2, b1);
    res_a *= a2 / max_faction;
    res_b *= b1 / max_faction;
    cout<<s1<< " * " << s2<<" = "<<format(res_a, res_b) <<endl;
    
    //div;
    max_faction = getMaxFaction(b1, b2);
    res_a = b2 / max_faction;
    res_b = b1 / max_faction;
    max_faction = getMaxFaction(a1, a2);
    res_a *= a1 / max_faction;
    res_b *= a2 / max_faction;
    if(res_b < 0){
        res_a = -res_a;
        res_b = -res_b;
    }
    cout<<s1<< " / " << s2<<" = "<<format(res_a, res_b) <<endl;
    
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值