摘要： 题目可以这样理解：给出一个数k，求\(\max\{n| n!# include int solve(int n){ double sum = 0; for (int i = 1; ; ++i) { sum += log(i)/log(2); if ((int)sum >= (0x1<<n)) return i-1; }}int main(){ int y, n; while (1) { scanf("%d", &y); if (y==0) break; n = (y-1960)/10+2; printf("%d\n", solv 阅读全文