BZOJ 1024: [SCOI2009]生日快乐 dfs

#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 1000100
#define mod 10007
#define eps 1e-9
int Num;
//const int inf=0x7fffffff;   //нчоч╢С
const int inf=0x3f3f3f3f;
inline ll read()
{
    ll x=0,f=1;char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
    return x*f;
}
//**************************************************************************************

double dfs(double x,double y,double k)
{
    if(k==1)
    {
        return max(x,y)/min(x,y);
    }
    double ans=inf;
    for(int i=1;i<k;i++)
    {
        double ans1=max(dfs(x/k*i,y,i),dfs(x/k*(k-i),y,k-i));
        double ans2=max(dfs(x,y/k*i,i),dfs(x,y/k*(k-i),k-i));
        ans = min(ans,min(ans1,ans2));
    }
    return ans;
}

int main()
{
    int x,y,n;
    scanf("%d%d%d",&x,&y,&n);
    printf("%.6lf\n",dfs(x*1.0,y*1.0,n*1.0));
}