uva 10719 Quotient Polynomial

#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <cstdio>
using namespace std;
const int N=10005;
int a[N],ans[N];
int deal(char*,int*);
int main()
{
    int k=0;
    while(scanf("%d",&k)!=EOF)
    {
        memset(ans,0,sizeof(ans));
        memset(a,0,sizeof(a));

        int cnt=0,i; char temp;
        while(1)
        {
            scanf("%d%c",&a[cnt++],&temp);
            if(temp=='
') break;
        }
        //for(int i=0;i<cnt;i++) printf("%d ",a[i]); puts("");
        for(i=0;i<cnt;i++)
        {
            ans[i]=a[i];
            a[i+1]-=ans[i]*(-k);
        }
        printf("q(x):");
        for(i=0;i<cnt-1;i++) printf(" %d",ans[i]);
        printf("
r = %d

",a[cnt-1]);
    }
	return 0;
}