BZOJ1024: [SCOI2009]生日快乐

爆搜不解释。。。。。



#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;

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

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


你可能感兴趣的:(bzoj)