1036.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1036 on 2006-01-19 at 04:04:55 */ 
#include <cstdio>

const int MAX = 128;

int main()
{
	int t, T, i, j;
	int n, m, d[MAX][MAX];
	
	scanf("%d", &T);
	for(t = 0; t < T; t++) {
		scanf("%d %d", &n, &m);
		for(i = 0; i < n; i++) scanf("%d", &d[0][i]);
		for(i = 0; i < n; i++)
			for(j = i+1; j < n; j++) d[i+1][j] = d[i][j]-d[i][j-1];
		for(j = 0; j < m; j++) {
			for(i = n-2; i >= 0; i--) d[i][n-1] += d[i+1][n-1];
			printf("%d", d[0][n-1]);
			if(j == m-1) putchar('\n');
			else putchar(' ');
		}
	}

  return 0 ;
}