Source Code
/**
 * Prof.Nicola
 * Let's try it with only integers
**/
#include <bits/stdc++.h>

using namespace std;
#define mp make_pair
#define F first
#define S second
#define REP(i,l,r) for(long long i=(l);i<(r);i++)
#define PER(i,l,r) for(long long i=(r)-1;i>=(l);i--)
const long dx[4]={1,0,-1,0},dz[4]={0,1,0,-1};
const long double pi=3.14159265359;
const long long mod=1e9+7;
template<class T>void re(T&x){cin>>x;}
template<class T1,class T2> void re(pair<T1,T2>&x){re(x.first);re(x.second);}
template<class T>void re(vector<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T>void re(deque<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T>void out(T x){cout<<x<<" ";}
template<class T1,class T2>void out(pair<T1,T2>x){out(x.first);out(x.second);cout<<endl;}
template<class T>void out(vector<T>x,long l=0,long r=0){if(!r){r=x.size();}for(long i=l;i<r;i++){out(x[i]);}cout<<endl;}
template<class T>void out(deque<T>x,long l=0,long r=0){if(!r){r=x.size();}for(long i=l;i<r;i++){out(x[i]);}cout<<endl;}
template<class T>T cross(complex<T>x,complex<T>z){return (conj(x)*z).imag();}
template<class T>T dot(complex<T>x,complex<T>z){return (conj(x)*z).real();}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long long a,b,l1,l2,r1,r2,z,x,y,bx,by;
    cin>>a>>b>>l1>>r1>>l2>>r2;
    bx=l1;
    by=l2;
    REP(i,l1,r1+1){
        z=(i*b)/a;
        z=max(z,l2);
        z=min(z,r2);
        if(abs(((i*b)-(z*a))*by)<abs(((bx*b)-(by*a))*z)){
            bx=i;
            by=z;
        }
        z++;
        z=max(z,l2);
        z=min(z,r2);
        if(abs(((i*b)-(z*a))*by)<abs(((bx*b)-(by*a))*z)){
            bx=i;
            by=z;
        }
    }
    cout<<bx<<" "<<by<<endl;
    return 0;
}
Copy
Fractions Rainbow
GNU G++17
28 ms
1.0 MB
Accepted