Light OJ 1326 Race (Strling数)

:

[code]#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<functional>

using namespace std;
const int MOD = 10056;

int n,S[1005][1005],Mul[1005];

void init(){
int i,j;
S[0][0] = Mul[0] = 1;
for(i = 1;i <= 1000;i++){
Mul[i] = (Mul[i-1]*i)%MOD;
S[i][1] = S[i][i] = 1;
for(j = 2;j < i;j++)
S[i][j] = (S[i-1][j-1]+j*S[i-1][j])%MOD;
}
}

int main(){
int i,j,cas,T;
init();
scanf("%d",&cas);
for(T = 1;T <= cas;T++){
scanf("%d",&n);
int res = 0;
for(i = 1;i <= n;i++){
res = (res+S
[i]*Mul[i])%MOD;
}
printf("Case %d: %d\n",T,res);
}
return 0;
}