uva 10719 - Quotient Polynomial

最新推荐文章于 2021-06-21 09:52:14 发布

滑头鬼之亨

最新推荐文章于 2021-06-21 09:52:14 发布

阅读量1.2k

点赞数

分类专栏：数学文章标签： integer input output each pair setter

本文链接：https://blog.csdn.net/Frankiller/article/details/7668763

版权

数学专栏收录该内容

9 篇文章 0 订阅

订阅专栏

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 of p(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 then q(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 polynomial q(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 for k. The second line will contain a list of integers (a_n, a_{n-1, …} a₀), which represent the set of co-efficient of a polynomial p(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

Problem setter: Mohammed Shamsul Alam
Special thanks to Tanveer Ahsan

读入的时候纠结了下，当字符串读入再取出数字。借鉴了下别人的读入方法，主要是当初做字符串读入的问题以‘\N'作为结束标志可能会runtime error，不敢滥用......

剩下的就是多项式相等

a4x4+a3x3+a2x2+a1x1+a0=x(b3x3+b2x2+b1x1+b0)-k*(b3x3+b2x2+b1x1+b0)+r
a4x4+a3x3+a2x2+a1x1+a0=b3x4+(b2-kb3)x3+(b1-kb2)x2+(b0-kb1)x+r-kbo;
1 2 3 4 5
a4 a3 a2 a1 a0
a[n-i];

an=bn-1;
a0=r-kb0;
a1=b0-kb1;
a2=b1-kb2;
a3=b2-kb3
a4=b3
bn-1=an+kbn

由于读入是倒序的所以下标转化下即可

#include<stdio.h>
#include<math.h>
void main()
{int p[10001],q[10001],i,j,k,n;
char ch;
while (scanf("%d",&k)!=EOF)
{n=1;
while (scanf("%d%c",&p[n],&ch))
{if (ch=='\n') break; ++n;}
q[n-1]=p[1];
for (i=n-2;i>=0;i--)
q[i]=k*q[i+1]+p[n-i];
printf("q(x):");
for (i=n-1;i>=1;i--)
printf(" %d",q[i]); printf("\n");
printf("r = %d\n",q[0]); printf("\n");
}
}