12034 - Race

利用二项式系数的概念，首先算出所有的系数的值，这里要注意一点在计算结果的时候要%10056，不然会报错。然后按照紫书中给出的递推关系式，求出所有的n对应的值，因为n不超过1000，这样做可以的，然后直接输入，打印结果即可，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

const int MOD = 10056;
const int maxn = 1000;
int C[maxn + 5][maxn + 5];
int f[maxn+5];

void Init(){
	for (int i = 0; i <= maxn; i++){
		C[i][0] = C[i][i] = 1;
		for (int j = 1; j < i; j++){
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1])%MOD;
		}
	}
	f[0] = 1;
	for (int i = 1; i <= maxn; i++){
		for (int j = 1; j <= i; j++){
			f[i] = (f[i] + C[i][j] * f[i - j]) % MOD;
		}
	}
}

int main(){
	Init();
	int T;
	cin >> T;
	for (int i = 1; i <= T;i++){
		int n;
		cin >> n;
		cout <<"Case "<<i<<": "<< f[n] << endl;
	}
}