#include<iostream> (5488)#include<algorithm> using namespace std; int t,n,cnt; int main(){ cin >> t; int nowm;//nowm表示现在最长绳长 for(int i = 1; i <= t; i++){ cin >> n; cnt = 1;//第一天啥也不干 nowm = n; while(nowm > 1){ if(nowm%2==0){//只考虑最长的那部分 nowm = nowm/2; } else{ nowm = nowm / 2 +1; } cnt ++; } cout << cnt << endl; } return 0; }