【UVA】11384 Help is needed for Dexter-找规律

---

题解

找规律可以发现每次将后$n/2+1,...,n$统一减去$n/2+1$，问题转化为两个等价的$1,2,...,n/2$。
故：$f_n=f_{n/2}+1$

---

代码

#include<bits/stdc++.h>
using namespace std;

int n;
int F(int x){return x==1?1:(F(x/2)+1);}

int main(){
	for(;~scanf("%d",&n);)
	 printf("%d\n",F(n));
}