uva11384

对1 , 2, ,3, ...n 这个序列操作最少的次数，序列元素都为0

又到了手玩样例环节

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

 int m;
 int f(int x){
 	return x==1?x:f(x/2)+1;
 }
 signed main(){
 	while(cin>>m) cout<<f(m)<<endl;
 }