题意分析
上去直接考虑一个数的二进制表示
答案 为 log2n + 1
#include <bits/stdc++.h>
#define rep(i,a,b) for (int i = a; i<=b; ++i)
using namespace std;
const int nmax = 1e6 + 10;
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef double db;
int n, ans = 0, m;
int main() {
scanf("%d", &m);
while (m) ans++, m = m >> 1;
printf("%d\n", ans);
return 0;
}