【算法笔记】Product of Polynomials

2022-01-03 12:23 作者:小幻不想码代码 0人读过 | 我要投稿

his time, you are supposed to find $A + B$ where $A$ and $B$ are two polynomials.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

$K$ $N^{1}$ $a^{N^{1}}$ $N^{2}$ $a^{N^{2}}$ ... $N^{K}$ $a^{N^{K}}$

where $K$ is the number of nonzero terms in the polynomial, $N^{i}$ and $a^{N^{i}}$ ( $i = 1, 2, \dots, K$ ) are the exponents and coefficients, respectively. It is given that $1 \leq K \leq 10$ ， $0 \leq N^{K} < \dots < N^{2} < N^{1} \leq 1000$ .

Output Specification:

For each test case you should output the sum of $A$ and $B$ in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.

Sample Input:

2 1 2.4 0 3.2

2 2 1.5 1 0.5

结尾无空行

Sample Output:

3 2 1.5 1 2.9 0 3.2