Quotient Polynomial

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29592#problem/M

// File Name: bo_jwolf13.cpp
// Author: rudolf
// Created Time: 2013年08月19日 星期一 22:20:17

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>

using namespace std;

int num1[ 10005 ] , num2[ 10005 ] ;
int main()
{
char temp ;
int k , c , n ;
while( scanf( "%d" , &k ) != EOF )
{
int i ;
for( i = 0 ; ; ++i )
{
scanf( "%d%c" , &num1[ i ] , &temp ) ;
if( temp == '\n' )
break;
}
n = i , c = num1[ 0 ] ;
cout << "q(x):" ;
for( i = 0 ; i < n ; ++i )
{
num2[ i ] = c ;
c = num1[ i + 1 ] + k * num2[ i ] ;
}
for( int i = 0 ; i < n ;++i )
cout << " " << num2[ i ] ;
cout << endl ;
cout << "r = " << c << endl ;
cout << endl ;
}
return 0;
}