[bzoj]1024: [SCOI2009]生日快乐
2017-06-03 19:19
435 查看
直接暴力求答案,听说标准解法是二分最小值?
#include <cstdio>
#include <algorithm>
using namespace std;
int x,y,n;
double dfs(double x,double y,int n)
{
register int i;
if (n==1) return (x>y)?(x/y):(y/x);
double ans=100000;
for (i=1;i<=n/2;i++)
ans=min(ans,min(max(dfs(x/n*i,y,i),dfs(x/n*(n-i),y,n-i)),max(dfs(x,y/n*i,i),dfs(x,y/n*(n-i),n-i))));
return ans;
}
int main()
{
scanf("%d %d %d",&x,&y,&n);
printf("%.6lf",dfs(x,y,n));
}
#include <cstdio>
#include <algorithm>
using namespace std;
int x,y,n;
double dfs(double x,double y,int n)
{
register int i;
if (n==1) return (x>y)?(x/y):(y/x);
double ans=100000;
for (i=1;i<=n/2;i++)
ans=min(ans,min(max(dfs(x/n*i,y,i),dfs(x/n*(n-i),y,n-i)),max(dfs(x,y/n*i,i),dfs(x,y/n*(n-i),n-i))));
return ans;
}
int main()
{
scanf("%d %d %d",&x,&y,&n);
printf("%.6lf",dfs(x,y,n));
}
相关文章推荐
- bzoj1024: [SCOI2009]生日快乐
- 【bzoj1024】[SCOI2009]生日快乐
- 【bzoj1024】[SCOI2009]生日快乐
- bzoj 1024: [SCOI2009]生日快乐
- bzoj1024 [SCOI2009]生日快乐
- 【BZOJ 1024】 [SCOI2009]生日快乐
- bzoj 1024 [SCOI2009]生日快乐
- BZOJ 1024 [SCOI2009] 生日快乐
- BZOJ 1024 【SCOI2009】 生日快乐
- bzoj千题计划115:bzoj1024: [SCOI2009]生日快乐
- bzoj 1024: [SCOI2009]生日快乐
- 【bzoj 1024】: [SCOI2009]生日快乐
- BZOJ1024: [SCOI2009]生日快乐
- BZOJ1024: [SCOI2009]生日快乐
- [BZOJ]1024: [SCOI2009]生日快乐
- 【BZOJ】【1024】【SCOI2009】生日快乐
- BZOJ 1024: [SCOI2009]生日快乐
- BZOJ 1024 [SCOI2009]生日快乐
- 【BZOJ 1024】[SCOI2009]生日快乐
- bzoj1024 [SCOI2009]生日快乐