2116.cpp

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

/*  This Code is Submitted by wywcgs for Problem 2116 on 2005-10-12 at 12:52:00 */ 
#include <cstdio>
#define  MAX  32
#define  HOOF_MAX  51200

int main()
{
	int i, j, k, l;
	long n, m, hoof[HOOF_MAX], hoofN = 0;
	long f[MAX] = {1}, num;
	bool begin;
	
	for(i = 1; i < MAX; i++) {
		f[i] = f[i-1] * 2;
	}
	for(i = 0; i < MAX; i++) {
		hoof[hoofN++] = f[i];
		for(j = 0; j < i; j++) {
			hoof[hoofN++] = f[i] + f[j];
			for(k = 0; k < j; k++) {
				hoof[hoofN++] = f[i] + f[j] + f[k];
				for(l = 0; l < k; l++) {
					hoof[hoofN++] = f[i] + f[j] + f[k] + f[l];
				}
			}
		}
	}
	while(scanf("%ld %ld", &n, &m) == 2) {
		begin = false;
		num = 0;
		for(i = 0; i < hoofN; i++) {
			if(hoof[i] >= n) {
				begin = true;
			}
			if(hoof[i] > m) {
				begin = false;
				break;
			}
			if(begin) {
				num++;
			}
		}
		printf("%ld\n", num);
	}
	
	return 0;
}