UVA 10719-Quotient Polynomial
题目大意:p(x) = (x-k)q(x)+ r,已知 k 和 p(x)求 r 和 q(x),p(x)是未知多项式
解题思路: 推出b[i] = a[i] + k*a[i-1]的结论
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int a[10010], b[10010], k, r;
char c;
while(scanf("%d", &k) != EOF) {
int n = 0;
scanf("%d%c", &a[n++], &c);
b[0] = a[0];
while(c != '\n') {
scanf("%d%c", &a[n], &c);
b[n] =a[n] + b[n-1] * k;
n++;
}
r = b[n-2] * k + a[n-1];;
printf("q(x):");
for(int i = 0; i < n - 1; i++) {
printf(" %d", b[i]);
}
printf("\n");
printf("r = %d\n", r);
printf("\n");
}
return 0;
}