3688558_ac_125ms_340k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

__int64 num[11][2001];

void init()
{
	int i, j, k;

	for (i = 1; i <= 2000; i++)
	{
		num[1][i] = i;
	}
	for (i = 2; i <= 10; i++)
	{
		for (j = (1 << (i - 1)); j <= 2000; j++)
		{
			__int64 tmp = 0;
			for (k = (1 << (i - 1)); k <= j; k++)
			{
				tmp += num[i - 1][k / 2];
			}
			num[i][j] = tmp;
		}
	}
}

void work()
{
	int cas = 1, tot;
	int n, m;

	scanf("%d", &tot);
	while (tot-- != 0)
	{
		scanf("%d%d", &n, &m);
		printf("Case %d: n = %d, m = %d, # lists = %I64d\n", cas++, n, m, num[n][m]);
	}
}

int main()
{
	init();
	work();
	return 0;
}