2036.cpp

哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码

/*  This Code is Submitted by wywcgs for Problem 2036 on 2005-10-01 at 09:05:58 */ 
#include <stdio.h>
#include <memory.h>

int main()
{
	long n, k, coef[10001], i, j;
	int haveNum, zero, p;
	
	while(scanf("%ld %ld", &n, &k) == 2) {
		if(n == -1 && k == -1) {
			return 0;
		} else {
			memset(coef, 0, sizeof(coef));
			for(i = 0; i <= n; i++) {
				scanf("%ld", &coef[i]);
			}
			haveNum = 0;
			zero = 0;
			if(n < k) {
				p = n;
			} else {
				p = k - 1;
				for(i = n - k; i >= 0; i--) {
					coef[i] -= coef[i + k];
					coef[i + k] = 0;
				}
			}
			for(i = 0; i <= p; i++) {
				if(coef[i] != 0) {
					if(haveNum) {
						putchar(' ');
					}
					for(j = 0; j < zero; j++) {
						printf("0 ");
					}
					printf("%ld", coef[i]);
					zero = 0;
					haveNum = 1;
				} else {
					zero++;
				}
			}
			if(!haveNum) {
				putchar('0');
			}
			putchar('\n');
		}
	}
	
	
	return 0;
}