Preparando MOJI

Polynom

2000ms 65536K

Description:

You are given a polynom in form p(x) = (x + a1)·(x + a2)·... (x + an). Write Pike program to print it in a standard form p(x) = xn + b1xn - 1 + ... + bn - 1x + bn. You should write each addend in form «C*X^K» (for example, 5*X^8).

Please, write the polynom in the shortest way, so you should skip unnecessary terms: some terms «C*X^K» should be reduced or even omitted. Look for the samples for clarification.

Input:

The first line of the input contains n (1 ≤ n ≤ 9). The following n lines contain integer ai ( - 10 ≤ ai ≤ 10).

Output:

Print the given polynom in a standard way. Note, that the answer in this problem response uniquely determined.

Sample Input:

2
-1
1

Sample Output:

X^2-1

Sample Input:

2
1
1

Sample Output:

X^2+2*X+1

Informação

Codeforces

Provedor Codeforces

Código CF100F

Tags

*specialimplementation

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:32:06

Relacionados

Nada ainda