#include<bits/stdc++.h> #define int long long using namespace std; int a,b,l,s1,s2; int gcd(int x,int y){ return y?gcd(y,x%y):x; } signed main(){ cin>>a>>b>>l; double s=a1.0/b; double ts=(double)INT_MAX; for(int i=1;i<=l;i++){ int t=(ai+b-1)/b; if(t>l)continue; int gys=gcd(i,t); int t1=t/gys; int t2=i/gys; double k1=t1*1.0/i; double c=fabs(k1-s); if(c<ts){ ts=c; s1=t1; s2=t2; } else if(c==ts){ if(t1+t2<s1+s2){ s1=t1; s2=t2; } } } cout<<s1<<' '<<s2; return 0; }

#include<bits/stdc++.h>
using namespace std;    
int i,j,a,b,ansa,ansb,l;
double x,y;
int gcd(int x,int y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int main(){
    scanf("%d%d%d",&a,&b,&l);
    ansa=l;ansb=1;
	for(int i=1;i<=l;i++){
		for(int j=1;j<=l;j++){
			if(gcd(i,j)==1&&i*b>=a*j&&i*1.0/j<ansa*1.0/ansb){
				ansa=i;
				ansb=j;
			}
		}
	}
    printf("%d %d",ansa,ansb);
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
double a,b,l,p,o,minn=INT_MAX;
bool hz(int n,int m)
{
	long long x;
	if(n<m) swap(n,m);
	while(n%m!=0)
	{
		x=n%m;
		n=m;
		m=x;
	}
	if(m==1) return true;
	else return false;
}
int main(){
    cin>>a>>b>>l;
    for(double i=1;i<=l;i++)
    {
    	for(double j=1;j<=l;j++)
    	{
    		if(hz(i,j)==true) 
    		{
				if(double(i/j)>=a/b) 
					if(i/j-a/b<minn)
					{
						minn=i/j-a/b;
						p=i;
						o=j;
					}
			}
		}
	}
    cout<<p<<' '<<o;
}

题解