/**************************************************************
Problem: 1024
User: BLADEVIL
Language: Pascal
Result: Accepted
Time:608 ms
Memory:224 kb
****************************************************************/

//By BLADEVIL
var
x, y :extended;
n :longint;

function max(a,b:extended):extended;
begin
if a>b then max:=a else max:=b;
end;

function min(a,b:extended):extended;
begin
if a>b then min:=b else min:=a;
end;

function dfs(x,y:extended;n:longint):extended;
var
ans, r :extended;
i :longint;
begin
if x>y then
begin
ans:=x; x:=y; y:=ans;
end;
if n=1 then exit(y/x);
r:=1/n; ans:=1e20;
for i:=1 to n-1 do
begin
ans:=min(ans,max(dfs(x*r*i,y,i),dfs(x-x*r*i,y,n-i)));
ans:=min(ans,max(dfs(x,y*i*r,i),dfs(x,y-y*r*i,n-i)));
end;
exit(ans);
end;


begin
read(x,y,n);
writeln(dfs(x,y,n):0:6);
end.

优质内容筛选与推荐>>
1、LVS笔记
2、SharePoint中计算值公式函数简介[转载]
3、从一次问题排查聊聊问什么要懂原理
4、设计模式学习笔记-简单工厂模式
5、Boost无锁队列