1088 Rational Arithmetic

最新推荐文章于 2024-09-12 19:02:20 发布

OHdebug

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量60

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/OHdebug/article/details/115103920

版权

problem 1088 Rational Arithmetic
partial same as 1081 Rational Sum

#include<iostream>
#include<cmath>
using namespace std;
#pragma warning(disable:4996)
long long gcd(long long a, long long b) {
    return b == 0 ? a : gcd(b, a % b);
}
struct Num {
    long long n, d, i = 0;
    void print();
    void simple();
};
void Num::print() {
    if (d == 0)cout << "Inf";
    else if (n < 0) {
        if (n % d == 0)
            cout << "(" << n / d << ")";
        else if (-n > d)
            cout << "(" << n / d << " " << -n % d << "/" << d << ")";
        else
            cout << "(" << n << "/" << d << ")";
    }
    else {
        if (n % d == 0)
            cout << n / d;
        else if (n > d)
            cout << n / d << " " << n % d << "/" << d;
        else
            cout << n << "/" << d;
    }
}
void Num::simple() {
    if (d < 0) {
        d = -d;
        n = -n;
    }
    if (n == 0)
        d = 1;
    else {
        int x = gcd(abs(n), abs(d));
        n /= x;
        d /= x;
    }
}
Num add(Num a, Num b) {
    Num* res = new Num;
    res->d = a.d * b.d;
    res->n = a.d * b.n + a.n * b.d;
    res->simple();
    return *res;
}
Num mul(Num a, Num b) {
    Num* res = new Num;
    res->n = a.n * b.n;
    res->d = a.d * b.d;
    res->simple();
    return *res;
}
int main(){
    Num a, b;
    scanf("%lld/%lld %lld/%lld", &a.n, &a.d, &b.n, &b.d);
    a.simple();
    b.simple();
    a.print(); cout << " + "; b.print(); cout << " = "; add(a, b).print(); cout << endl;
    Num b1 = b;
    b1.n = -b1.n;
    a.print(); cout << " - "; b.print(); cout << " = "; add(a, b1).print(); cout << endl;
    a.print(); cout << " * "; b.print(); cout << " = "; mul(a, b).print(); cout << endl;
    Num b2 = b;
    swap(b2.d, b2.n);
    a.print(); cout << " / "; b.print(); cout << " = "; mul(a, b2).print(); cout << endl;
    return 0;
}