[NOIP 2014] 比例简化

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a,int b)
{
    if(b==0)
        return a;
    return gcd(b,a%b);
}
int main()
{
    ll a,b,l;
    cin>>a>>b>>l;
    int x1,x2;
    ll mi=101;
    ll mj=1;
    ll p1;
    ll p2;
    for(ll i=1; i<=l; i++)
    {
        for(ll j=1; j<=l; j++)
        {
            if(gcd(i,j)!=1)
                continue;
            x1=i*b-j*a;
            if(x1<0)
                continue;
            x2=j*b;
            ll k=gcd(x1,x2);
            x1=x1/k;
            x2=x2/k;
            if(x1*mj-x2*mi<0)
            {
                mi=x1;
                mj=x2;
                p1=i;
                p2=j;
            }
        }
    }
    cout<<p1<<" "<<p2<<endl;
    return 0;
}