HDOJ 1121 Complete the Sequence

 1 #include<stdio.h>
 2 #define NN 102
 3 int main()
 4 {
 5     int T, i, j, S, C;
 6     int f[NN][NN];
 7     scanf("%d", &T);
 8     while (T--){
 9         scanf("%d%d", &S, &C);
10         for (i = 0; i < S; i++)
11             scanf("%d", &f[0][i]);
12         for (i = 1; i < S; i++)
13             for (j = 0; i + j < S; j++)
14                 f[i][j] = f[i - 1][j + 1] - f[i - 1][j];
15         for (i = 1; i <= C; i++)
16             f[S - 1][i] = f[S - 1][0];
17         for (i = S - 2; i >= 0; i--)
18             for (j = S - i; j < C + S; j++)
19                 f[i][j] = f[i][j - 1] + f[i + 1][j - 1];
20         for (i = S; i < S + C - 1; i++)
21             printf("%d ", f[0][i]);
22         printf("%d\n", f[0][i]);
23     }
24     return 0;
25 }