BZOJ1021-1030_bzoj1030-CSDN博客

本文链接：https://blog.csdn.net/Gvolv/article/details/49387737

1022 [SHOI2008]小约翰的游戏John
nim博弈,一个石子要特殊处理
1024 [SCOI2009]生日快乐
dfs,切矩形

/**************************************************************
    Problem: 1024
    User: Gvolv
    Language: C++
    Result: Accepted
    Time:284 ms
    Memory:1272 kb
****************************************************************/

#include<cstdio>
#include<iostream>
#define cyc(i,x,y) for(i=(x);i<=(y);i++)
using namespace std;
double min(double x,double y) {return x<y ? x:y;}
double max(double x,double y) {return x>y ? x:y;}
double dfs(int n,double x,double y)
{
    int i;
    if(n==1) return max(x,y)/min(x,y);
    double r=1e10;
    cyc(i,1,n-1)
    {
        r=min(r,max(dfs(i,x*i/n,y),dfs(n-i,x*(n-i)/n,y)));
        r=min(r,max(dfs(i,x,y*i/n),dfs(n-i,x,y*(n-i)/n)));
    }
    return r;
}
int main()
{
    int n,x,y;
    scanf("%d%d%d",&x,&y,&n);
    printf("%.6lf\n",dfs(n,x,y)); 
    return 0;
}