A1002. A+B for Polynomials (25)

最新推荐文章于 2020-08-08 10:18:14 发布

原创最新推荐文章于 2020-08-08 10:18:14 发布 · 356 阅读

0 ·

CC 4.0 BY-SA版权

算法笔记实践记录第三章专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种计算两个多项式相加的方法，并提供了一个使用C++实现的具体示例。输入包含两个多项式的系数和指数，输出为这两个多项式相加后的结果。

A1002

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

Input

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:K N1 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (i=1, 2, ..., K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10，0 <= NK < ... < N2 < N1 <=1000.

Output

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

我的AC代码：

#include <cstdio>
double a[1005] = { 0 }, b[1005] = { 0 };
int main() {
    int n,e;
    double k;
    scanf("%d", &n);
    while (n--) {
        scanf("%d%lf", &e, &k);
        a[e] = k;
    }
    scanf("%d", &n);
    while (n--) {
        scanf("%d%lf", &e, &k);
        b[e] = k;
    }
    int count = 0;
    for (int i = 0; i < 1001; i++) {
        a[i] += b[i];
        if (a[i] != 0) {
            count++;
        }
    }
    printf("%d", count);
    for (int i = 1000; i >= 0; i--) {
        if (a[i] != 0) {
            printf(" %d %.1f", i, a[i]);
        }
    }
    return 0;
}