当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1814:Polynomial

题目描述
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.
输入解释
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.
输出解释
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
输入样例
2
5 1 -3 4 -4 3 -1
2 1 -1 -2
输出样例
2
3 1 1 -1
1 2 1 0 1
1
1 2 1 -1 -2
提示
补充:
如果f=a1^n1*...at^nt(n1>...>nt)

那么要求a1,a2...at两两互质

该题目是Virtual Judge题目,来自 北京大学POJ

题目来源 POJ Monthly

源链接: POJ-1814

最后修改于 2020-10-29T06:14:49+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000 131072