UVa 11384 Help is needed for Dexter

 1 #include<iostream>  
 2 #include<cstdio>  
 3 #include<cstring> 
 4 #include <cmath> 
 5 #include<stack>
 6 #include<vector>
 7 #include<map> 
 8 #include<set>
 9 #include<queue> 
10 #include<algorithm>  
11 using namespace std;
12 
13 typedef long long LL;
14 const int INF = (1<<30)-1;
15 const int mod=1000000007;
16 const int maxn=1000005;
17 
18 int f(int n){
19     if(n == 1) return 1;
20     return f(n/2) + 1;
21 }
22 
23 int main(){
24     int n;
25     while(scanf("%d",&n) != EOF){
26         printf("%d\n",f(n));
27     }
28     return 0;
29 }