假设有n只老鼠 每只老鼠有两种状态 死或活 则n只老鼠有 2^n方种状态 所以n只老鼠可以确定2^n只瓶子
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <string>
#include <cstring>
#include <algorithm>
#include <iostream>
#define maxn 105
#define INF 0x7fffffff
#define inf 10000000
#define MOD 1000000007
#define ull unsigned long long
#define ll long long
using namespace std; int main()
{
int t, ca = 0;
scanf("%d", &t);
while(t --)
{
ll n, one = 1;
int ans = 0;
scanf("%I64d", &n);
while((one << ans) <= n) ++ ans;
printf("Case %d: %d\n", ++ca, ans);
}
return 0;
}