设p(x)的各项系数为p[max],q(x)的各项系数为q[max];
可以知道q（x）的最高次项的系数q[0]=p[0];
关键的公式是
1. for (int i = 1; i < n; i++)
2. q[i] = p[i] + k * q[i - 1];
代码为
#include<cstdio> int p[10010], q[10010]; int main(void) { int k, n; char c; while (~scanf("%d", &k)) { c = 1; for (n = 0; c != 'n'; n++) scanf("%d%c", &p[n], &c); q[0] = p[0]; for (int i = 1; i < n; i++) q[i] = p[i] + k * q[i - 1]; printf("q(x):"); for (int i = 0; i < n - 1; i++) printf(" %d", q[i]); printf("nr = %dnn", q[n - 1]); } return 0; }