GCD LCM 最大公约数 最小公倍数 分数模板 (防溢出优化完成)

自己写的一个分数模板，在运算操作时进行了防溢出的优化：

ll gcd(ll a, ll b) {
    return b ? gcd(b, a%b) : a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a,b) * b;
}

struct divi {
    ll a = ,b = ;
};

divi simdiv(divi a) {
    ll i;
    divi divn = a;
    ll k = gcd(a.a,a.b);
    divn.a /= k;
    divn.b /= k;
    if(divn.b < ) {
        divn.a = -divn.a;
        divn.b = -divn.b;
    }
    return divn;
}

divi plusdiv(divi i,divi j) {
    divi a = simdiv(i);
    divi b = simdiv(j);
    divi dn;
    dn.b = lcm(a.b,b.b);
    dn.a = a.a*(dn.b/a.b)+b.a*(dn.b/b.b);
    return simdiv(dn);
}

divi minusdiv(divi i,divi j) {
    divi a = simdiv(i);
    divi b = simdiv(j);
    divi dn;
    dn.b = lcm(a.b,b.b);
    dn.a = a.a*(dn.b/a.b)-b.a*(dn.b/b.b);
    return simdiv(dn);
}

divi muldiv(divi i, divi j) {
    divi a = simdiv(i);
    divi b = simdiv(j);
    divi dn;
    ll chu1 = gcd(a.a,b.b);
    ll chu2 = gcd(a.b,b.a);
    dn.b = (a.b/chu2) * (b.b/chu1);
    dn.a = (a.a/chu1) * (b.a/chu2);
    return simdiv(dn);
}

divi divdiv(divi i,divi j) {
    divi a = simdiv(i);
    divi b = simdiv(j);
    divi dn;
    ll chu1 = gcd(a.a,b.a);
    ll chu2 = gcd(a.b,b.b);
    dn.b = (a.b / chu2) * (b.a / chu1);
    dn.a = (a.a / chu1) * (b.b / chu2);
    return simdiv(dn);
}

int cmpdiv(divi i,divi j) {    //a>b返回1, a=b返回0, a<b返回-1, 无法比较返回INF
    divi a = simdiv(i);
    divi b = simdiv(j);
    if(a.b ==  || b.b == ) {
        if(a.b ==  && b.b == )    return INF;
        else {
            if(a.b == ) {
                if(a.a > )    return ;
                if(a.a < )    return -;
                if(a.a == )    return INF;
            } else {
                if(b.b == ) {
                    if(b.a > )    return -;
                    if(b.a < )    return ;
                    if(b.a == )    return INF;
                }
            }
        }
    } else {
        ll di = lcm(a.b,b.b);
        ll a1 = a.a * (di / a.b);
        ll a2 = b.a * (di / b.b);
        if(a1 > a2)    return ;
        if(a1 == a2)    return ;
        if(a1 < a2)    return -;
    }
}

double valueofdiv(divi a) {
    if(a.a == )    return ;
    if(a.b == ) {
        if(a.a >= )    return (double)INF;
        if(a.a < )    return -(double)INF;
    }
    return (double)a.a/(double)a.b;
}

测试代码：

divi a,b;
while(==) {
    scanf("%lld%lld",&a.a,&a.b);
    scanf("%lld%lld",&b.a,&b.b);
    printf("+: %lld/%lld\n",plusdiv(a,b).a,plusdiv(a,b).b);
    printf("-: %lld/%lld\n",minusdiv(a,b).a,minusdiv(a,b).b);
    printf("*: %lld/%lld\n",muldiv(a,b).a,muldiv(a,b).b);
    printf("/: %lld/%lld\n",divdiv(a,b).a,divdiv(a,b).b);
    printf("cmp: %d\n",cmpdiv(a,b));
    printf("value: %lf %lf\n",valueofdiv(a),valueofdiv(b));
}