ac神··· 有点过了 呃呃······························································ 点赞+关注哦哦！(＾Ｕ＾)ノ~ＹＯ<(￣︶￣)↗[GO!]

我，新秀答案共享师（编程地板砖），期待你滴官主（和赞）（acgo觉得很赞）

这题没啥好说的，简单得要命，直接上代码：

时间复杂度=O( log2(n) )

#include<bits/stdc++.h> using namespace std; int main(){ int n,a=1,d=0;cin>>n; while(1){ a*=2; d++; if(a>n)break;//重点 } cout<<d; return 0; }

#include<iostream> using namespace std; int main(){ int n; cin>>n; int day=0; for(int i=1;i<=n;i*=2){ day+=1; } cout<<day; return 0; }