1002 A+B for Polynomials (25 分)

This 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,\cdots ,K$) are the exponents and coefficients, respectively. It is given that $1\le K\le 10$，
$0\le N_K<\cdots <N_2<N_1\le 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

题解

计算多项式$A+B$ 的和。

多项式的次数的范围较小，可以使用哈希直接映射。输出时从后往前输出所有系数不为0的指数和系数。

#include <cstdio>

constexpr auto SIZE = 10005;
double poly[SIZE];

int main() {
    for (int i = 0; i < 2; ++i) {
        int k;
        scanf("%d", &k);
        for (int j = 0; j < k; ++j) {
            int p;
            double q;
            scanf("%d %lf", &p, &q);
            poly[p] += q;
        }
    }

    int cnt = 0;
    for (int i = 0; i < SIZE; ++i)
        if (poly[i] != 0)
            ++cnt;
    printf("%d", cnt);

    if (cnt)
        for (int i = SIZE - 1; i >= 0; --i)
            if (poly[i] != 0)
                printf(" %d %.1f", i, poly[i]);
}