UVA 11384 Help is needed for Dexter 找规律 .

题目地址：http://vjudge.net/problem/UVA-11384

我是打表出来然后看出来规律的

刘汝佳的递推更加完美一点

f(n)=f(n/2)+1;

#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
	int n;
	while(scanf("%d",&n)==1)
		cout<<(int)(log(n)/log(2)+1)<<endl;
	return 0;
}