规律就是:f(n) = f(n/2)+1;f(1)=1;
已AC代码:
#include <cstdio>
#include<algorithm>
using namespace std;
int f(int n)
{
return n==1?1:f(n/2)+1;
}
int main()
{
int n;
while((scanf("%d", &n))!=EOF)
{
printf("%d\n", f(n));
}
return 0;
}
转载请注明原文地址: https://ju.6miu.com/read-1299160.html