uva 10719 Quotient Polynomial

Description

 

Problem B

Quotient Polynomial

Time Limit

2 Seconds

A polynomial of degree n can be expressed as

If k is any integer then we can write:

Here q(x) is called the quotient polynomial ofp(x) of degree (n-1) and r is any integer which is called the remainder.

For example, if p(x) = x³- 7x²+ 15x - 8 and k = 3 thenq(x) = x² - 4x + 3 and r = 1. Again if p(x) = x³ - 7x²+15x - 9 and k = 3 then q(x) = x²- 4x + 3 and r = 0.

In this problem you have to find the quotient polynomialq(x) and the remainder r. All the input and output data will fit in 32-bit signed integer.

Input

Your program should accept an even number of lines of text. Each pair of line will represent one test case. The first line will contain an integer value fork. The second line will contain a list of integers (a_n, a_{n-1, …}a₀), which represent the set of co-efficient of a polynomialp(x). Here 1 ≤ n ≤ 10000. Input is terminated by <EOF>.

Output

For each pair of lines, your program should print exactly two lines. The first line should contain the coefficients of the quotient polynomial. Print the reminder in second line. There is a blank space before and after the ‘=’ sign. Print a blank line after the output of each test case. For exact format, follow the given sample.

Sample Input

Output for Sample Input

3
1 -7 15 -8
3
1 -7 15 -9

q(x): 1 -4 3
r = 1

q(x): 1 -4 3
r = 0

题目大意：多项式求除法商，就是将多项式分解成p(x) = （x - k) * q(x), 求q(x)各项的系数.

解题思路：q（x)中除了最高次项的系数与p(x)最高项的系数相同，其它系数有一个规律q[i] = p[i] + k * q[i - 1].

PS:注意数组大小……

#include<stdio.h>#include<string.h>int main() {int p[10005], q[10005], k, cnt;char ch;while (scanf("%d", &k) != EOF) {cnt = 0;ch = '\0';memset(p, 0, sizeof(p));memset(q, 0, sizeof(q));while (1) {scanf("%d%c", &p[cnt++], &ch);  if (ch == '\n') { break;  }} q[0] = p[0];for (int i = 1; i < cnt; i++) {    q[i] = p[i] + k * q[i - 1];}printf("q(x):");for (int i = 0; i < cnt - 1; i++) {printf(" %d", q[i]);}printf("\nr = %d\n\n", q[cnt - 1]);}return 0;}