UVa 12034 Race

Disky and Sooma, two of the biggest mega minds of Bangladesh went to a far country. They ate, coded and wandered around, even in their holidays. They passed several months in this way. But everything has an end. A holy person, Munsiji came into their life. Munsiji took them to derby (horse racing). Munsiji enjoyed the race, but as usual Disky and Sooma did their as usual task instead of passing some romantic moments. They were thinking- in how many ways a race can finish! Who knows, maybe this is their romance!

In a race there are n horses. You have to output the number of ways the race can finish. Note that, more than one horse may get the same position. For example, 2 horses can finish in 3 ways.

1. Both first
2. horse₁ first and horse₂ second
3. horse₂ first and horse₁ second

Input 

Input starts with an integer  T  ( 1000 ), denoting the number of test cases. Each case starts with a line containing an integer  n  (   1n1000 ).

Output 

For each case, print the case number and the number of ways the race can finish. The result can be very large, print the result modulo 10056.

Sample Input 

3
1
2
3

Sample Output 

Case 1: 1
Case 2: 3
Case 3: 13

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

组合数~

分为第一有1人，有2人，……，有n人的情况，则分别可以转化为前面求过的f值，公式为∑C(n,i)f(n-i)。

#include<cstdio>
#define modd 10056

int t,n,cnt,c[1001][1001],f[1001];

void findd()
{
	c[0][0]=1;f[0]=1;
    for(int i=1;i<=1000;i++)
    {
        c[i][0]=c[i][i]=1;f[i]=0;
        for(int j=1;j<i;j++) c[i][j]=(c[i-1][j-1]+c[i-1][j])%modd;
        for(int j=1;j<=i;j++) f[i]=(f[i]+c[i][j]*f[i-j]%modd)%modd;
	}
}

int main()
{
	findd();
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		printf("Case %d: %d\n",++cnt,f[n]);
	}
	return 0;
}