你先别用快读试试，我有次也是快读卡bug
by Qiuly @ 2019-01-22 11:33:28
@[Qiuly](/space/show?uid=113190) [还是全tle](https://www.luogu.org/recordnew/show/15588401)
by d3NtMDAw @ 2019-01-22 11:43:22
你的和题解好像啊，看看题解呗
by Qiuly @ 2019-01-22 12:28:09
@[wsm000](/space/show?uid=32196)
by Qiuly @ 2019-01-22 12:28:13
@[Qiuly](/space/show?uid=113190) ~~就是因为对着题解改了好多遍，才变成这样的~~
by d3NtMDAw @ 2019-01-22 12:44:29
@[wsm000](/space/show?uid=32196) emmm
by Qiuly @ 2019-01-22 12:46:37
@[d3NtMDAw](/space/show?uid=32196) 读入是x、y、n
by torque @ 2019-10-08 21:27:10
@[六道仙人](/space/show?uid=118382) 谢谢，修改后已经ac
by d3NtMDAw @ 2019-10-11 21:02:12
@[d3NtMDAw](/space/show?uid=32196) 不谢。我也是这个问题，改了之后就好了，顺便跟你说一声
by torque @ 2019-10-12 07:26:30
```
#include<cstdio>
#include<algorithm>
#define N 1005
using namespace std;
double dp[N][N][13];
int x,y,nn;
double dfs(double x,double y,int n){
if(n==1)return max(x,y)*1.0/min(x,y);
double ans=0x7fffff,mx=x/n,my=y/n;
for(int i=1;i<=n/2;i++){
double t1=max(dfs(mx*i,y,i),dfs(x-mx*i,y,n-i)),t2=max(dfs(x,my*i,i),dfs(x,y-my*i,n-i));
ans=min(ans,min(t1,t2));
}
return ans;
}
int main(){
scanf("%d%d%d",&x,&y,&nn);
printf("%.6lf\n",dfs(x,y,nn));
return 0;
}
```
by 黑影洞人 @ 2021-08-05 11:09:06