玄学搜索
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long LL;
inline LL read()
{
LL x=0;bool f=0;char c=getchar();
for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
return f?-x:x;
}
int n,x,y;double oo=1e18;
double dfs(double x,double y,int n)
{
if (n==1) return max(x/y,y/x);
double rec=oo;
for (int i=1;i<n;i++)
rec=min(rec,max(dfs(x*(n-i)/n,y,n-i),dfs(x*i/n,y,i)));
for (int i=1;i<n;i++)
rec=min(rec,max(dfs(x,y*(n-i)/n,n-i),dfs(x,y*i/n,i)));
return rec;
}
int main()
{
x=read(),y=read(),n=read();
printf("%.6lf\n",dfs(x,y,n));
return 0;
}