[BZOJ2187][类欧几里得算法]fraction

题意

---

求p,q满足$\dfrac{a}{b}<\dfrac{p}{q}<\dfrac{c}{d}$的解

---

推一发

$$若\lfloor \dfrac{a}{b}\rfloor+1\leq\lceil \dfrac{c}{d}\rceil -1 \rightarrow \lfloor \dfrac{a}{b}\rfloor+1$$

$$若a=0 \rightarrow \dfrac{p}{q}<\dfrac{c}{d} \rightarrow q>\dfrac{dp}{c}$$ 因为q要求最小 $$p=1,q=\lceil \dfrac{d}{c}\rceil$$

$$若a<=b~ and~ c<=d \rightarrow \dfrac{d}{c}<\dfrac{q}{p}<\dfrac{b}{a}$$

$$Else ~\dfrac{a\%b}{b}<\dfrac{p}{q}-\lfloor\dfrac{a}{b}\rfloor<\dfrac{c}{d}-\lfloor\dfrac{a}{b}\rfloor$$

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pairs;

ll a,b,c,d,g;

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

inline void simplify(ll &a,ll &b){
    ll g=gcd(a,b); a/=g; b/=g;
}

pairs solve(ll p1,ll q1,ll p2,ll q2){
    simplify(p1,q1); simplify(p2,q2);
    ll a=p1/q1+1,b=(ll)ceil((double)p2/q2)-1;
    if(a<=b) return pairs(a,1);
    if(p1==0) return pairs(1,(ll)(q2/p2)+1);
    if(p1<=q1&&p2<=q2){
        pairs r=solve(q2,p2,q1,p1);
        swap(r.first,r.second);
        return r;
    }
    ll t=p1/q1;
    pairs r=solve(p1%q1,q1,p2-t*q2,q2);
    r.first+=r.second*t;
    return r;
}

int main(){
    while(~scanf("%lld%lld%lld%lld",&a,&b,&c,&d)){
        pairs Ans=solve(a,b,c,d);
        printf("%lld/%lld\n",Ans.first,Ans.second);
    }
}