编程介的小学生 2019-08-28 21:51 采纳率: 20.5%
浏览 244

Polynomial 程序的编写

Description

In the present problem, we always assume that all the polynomials mentioned have the following properties (take f(x) for example ):
(1) 0 < deg(f) <= 20, so we can assume that f(x) has the following form:
f(x)=anxn+an-1xn-1+...+a1x+a0 (an!=0 and 1<=n<=20)

(2) ai ( i=0,1,...,n ) is integer, and ?2^31<=ai<=2^31-1;
(3) an = 1.

We call a polynomial G(x) "good" polynomial, when there is no polynomial F(x) such that
F2|G

Given a polynomial f(x), it is known that f(x) can be factorized as follow:
f(x)=GtmtGt-1mt-1...G1m1 (Gi is good and mt>mt-1>...>m1>=1)
It抯 easy to prove that this way of factorizing is unique. You job is to factorize the given polynomials in this way.

To make input and output easy, a polynomial f(x)
f(x)=anxn+an-1xn-1+...+a1x+a0 (an!=0 and 1<=n<=20)

is represented as
n an an-1 ... a1 a0

In this representation, we use (n+2) integers, which are separated by single blanks.
Input

The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Every case gives a polynomial in a single line.
Output

For each test case, output the corresponding result in the following form (where the meaning of those characters is taken as just mentioned):
t
mt Gt
mt-1 Gt-1
...
m1 G1
Sample Input

2
5 1 -3 4 -4 3 -1
2 1 -1 -2
Sample Output

2
3 1 1 -1
1 2 1 0 1
1
1 2 1 -1 -2

  • 写回答

0条回答 默认 最新

    报告相同问题?

    悬赏问题

    • ¥15 Arcgis相交分析无法绘制一个或多个图形
    • ¥15 seatunnel-web使用SQL组件时候后台报错,无法找到表格
    • ¥15 fpga自动售货机数码管(相关搜索:数字时钟)
    • ¥15 用前端向数据库插入数据,通过debug发现数据能走到后端,但是放行之后就会提示错误
    • ¥30 3天&7天&&15天&销量如何统计同一行
    • ¥30 帮我写一段可以读取LD2450数据并计算距离的Arduino代码
    • ¥15 飞机曲面部件如机翼,壁板等具体的孔位模型
    • ¥15 vs2019中数据导出问题
    • ¥20 云服务Linux系统TCP-MSS值修改?
    • ¥20 关于#单片机#的问题:项目:使用模拟iic与ov2640通讯环境:F407问题:读取的ID号总是0xff,自己调了调发现在读从机数据时,SDA线上并未有信号变化(语言-c语言)