新疆大学（新大）OJ xju 1006: 比赛排名 第二类斯特林数+阶乘

#include<cstdio>  
#include<cstring>
#include<iostream>
using namespace std;

const int mod = 10056;

int dp[1010][1010];
int main()  {  
  int t,n;
  cin >> t;
  int k = 1;
  while(t--){
      cin >> n;
      dp[0][0] = 1;
        for(int i = 1;i <= n; i++){
            for(int j = 1;j <= i; j++){
                    dp[i][j] = (dp[i-1][j-1]+j*dp[i-1][j])%mod;
            }
        } 
        
        int num = 1;
        int ans = 0;
        for(int j = 1;j <= n; j++){
            num = (num * j)%mod;
            ans = (ans + num*dp[n][j])%mod;
        }
        cout << "Case " << k++ << ": ";
        cout << ans << endl;
        
    }
  
  return 0;  
}