[BZOJ1192] [HNOI2006]鬼谷子的钱袋

传送门

http://www.lydsy.com/JudgeOnline/problem.php?id=1192

题目大意

2k>n求最小k

var
 i,n,ans:longint;
begin
 readln(n); i:=1; ans:=0;
 while i<n do
  begin
   i:=i*2;
   inc(ans);
  end;
 writeln(ans);
end.