HDU 2512 一卡通大冒险

 1 //#define LOCAL
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <cstring>
 5 using namespace std;
 6 
 7 const int maxn = 2005;
 8 int dp[maxn][maxn];
 9 
10 int main(void)
11 {
12     #ifdef LOCAL
13         freopen("2512in.txt", "r", stdin);
14     #endif
15 
16     int i, j;
17     for(i = 1; i <= 2000; ++i)
18     {
19         dp[i][1] = 1;
20         dp[i][i] = 1;
21     }
22     for(i = 2; i <= 2000; ++i)
23         for(j = 2; j < i; ++j)
24             dp[i][j] = (dp[i-1][j-1] + j * dp[i-1][j]) % 1000;
25 
26     int n, num, sum;
27     scanf("%d", &n);
28     while(n--)
29     {
30         scanf("%d", &num);
31         sum = 0;
32         for(i = 1; i <= num; ++i)
33             sum = (sum + dp[num][i]) % 1000;
34         printf("%d\n", sum);
35     }
36     return 0;
37 }