【bzoj 1024】: [SCOI2009]生日快乐

http://www.lydsy.com/JudgeOnline/problem.php?id=1024

n<=10，hehe无脑搜索

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
/************************************************
Code By willinglive Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/////////////////////////////////////////////////
inline void MIN(double &a,double b){if(a>b)a=b;}
/////////////////////////////////////////////////
double dfs(double x,double y,int n)
{
if(x<y) swap(x,y);
if(n==1) return x/y;
double ans=1e99;
rep(i,1,n/2)
{
double cut=x/n*i;
MIN(ans,max(dfs(cut,y,i),dfs(x-cut,y,n-i)));
cut=y/n*i;
MIN(ans,max(dfs(x,cut,i),dfs(x,y-cut,n-i)));
}
return ans;
}
/////////////////////////////////////////////////
void input()
{

}
void solve()
{
int x,y,n;
x=read(); y=read(); n=read();
printf("%.6lf\n",dfs((double)x,(double)y,n));
}
/////////////////////////////////////////////////
int main()
{
#ifndef _TEST
freopen("std.in","r",stdin); freopen("std.out","w",stdout);
#endif
input(),solve();
return 0;
}