2122.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2122 on 2005-10-15 at 18:35:25 */ 
#include <cstdio>
#include <cmath>
#define  MAX  32
#define  NUM_MAX  262144

double lo[NUM_MAX] = {0};

int main()
{
	long f[MAX] = {1};
	int inte[MAX], year;
	int i, p = 0, n;
	
	for(i = 1; i < MAX; i++) {
		f[i] = f[i-1] * 2;
	}
	for(i = 1; i < NUM_MAX; i++) {
		lo[i] = log2(i) + lo[i-1];
		while(true) {
			if(f[p] - lo[i] < 1e-3 && p < MAX) {
				inte[p] = i - 1;
				p++;
			} else {
				break;
			}
		}
	}
	while(scanf("%d", &year) == 1) {
		if(year == 0) {
			return 0;
		} else {
			n = (year - 1960) / 10 + 2;
			printf("%d\n", inte[n]);
		}
	}
	
	return 0;
}