BZOJ1024 SCOI2009 生日快乐 DFS

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 66666.0

int N;
double X,Y;

double DFS(double x,double y,int c){
    if(c==1){
        if(x<y) swap(x,y);
        return x/y;
    }

    double t=x/c,Ans=INF;
    for(int i=1;i<c;i++){
        double r=max(DFS(t*i,y,i),DFS(x-t*i,y,c-i));
        Ans=min(Ans,r);
    }
    t=y/c;
    for(int i=1;i<c;i++){
        double r=max(DFS(x,t*i,i),DFS(x,y-t*i,c-i));
        Ans=min(Ans,r);
    }
    return Ans;
}

int main(){
    scanf("%lf %lf %d",&X,&Y,&N);
    printf("%.6lf\n",DFS(X,Y,N));

    return 0;
}