POJ2527 Polynomial Remains

//4_7_6:	Polynomial Remains 多项式整除后的余数 POJ2527
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxw = 10000 + 10;
int main()
{
	int a[maxw] = {0};
	int i,n,k;
	while(1)
	{
		scanf("%d%d",&n,&k);
		if(n == -1 && k == -1)
			break;
		for(i = 0;i <= n;i ++)
			scanf("%d",&a[i]);
		while(n >= k)
		{
			a[n - k] -= a[n];
			a[n] = 0;
			i = n - 1;
			while(i >= 0 && a[i] == 0)
				i --;
			n = i;
		}
		if(n == -1)
			printf("0\n");
		else
		{
			for(i = 0;i < n;i ++)
				printf("%d ",a[i]);
			printf("%d\n",a[n]);
		}
	}
	return 0;
}
/*测试结果：通过POJ2527检测
6 3
2 3 -3 4 1 0 1
-1 2 -3
0 0
7
0
1 0
5 1
0
3 5
1 2 3 4
1 2 3 4
4 1
1 4 1 1 1
-2
5 2
0 0 3 2 0 1
-3 -1
5 2
6 3 3 2 0 1
3 2
-1 -1
请按任意键继续. . .
*/