bzoj1024 [SCOI2009]生日快乐（爆搜）

每次枚举这一刀切在哪里即可。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
inline double dfs(double x,double y,int n){
    if(n==1) return x>y?x/y:y/x;double res=inf;
    for(int i=1;i<=n/2;++i){
        double xx=x/n*i,yy=y/n*i;
        res=min(res,min(max(dfs(xx,y,i),dfs(x-xx,y,n-i)),max(dfs(x,yy,i),dfs(x,y-yy,n-i))));
    }return res;
}
int main(){
//  freopen("a.in","r",stdin);
    int x=read(),y=read(),n=read();
    printf("%.6lf\n",dfs(x,y,n));
    return 0;
}