1. 本质求 n!<2^bit 中n的最大值
2. 左右取log2 ,求 log2(n!)<bit 中n的最大值
3. log2(n!)<bit 等价于 log2(1)+log2(2)+.....log2(n) <bit
#include<iostream>
#include<math.h>
#include<cmath>
using namespace std;
int year,aa;
double num,sum;
int main()
{
while(cin>>year&&year)
{
num=pow(2.0,(year-1960)/10+2);
sum=0;
aa=1;
do{
sum+=log((double)aa++)/log((double)2);
}while(sum<num);
cout<<aa-2<<endl;
}
return 0;
}