1002 A+B for Polynomials (25分)

最新推荐文章于 2022-03-31 12:08:15 发布

韵影

最新推荐文章于 2022-03-31 12:08:15 发布

阅读量55

点赞数

分类专栏： PTA甲级

本文链接：https://blog.csdn.net/weixin_44238239/article/details/108940535

版权

C++ 多项式算法数值计算编程

关键词由CSDN通过智能技术生成

PTA甲级专栏收录该内容

23 篇文章 0 订阅

订阅专栏

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 N1 aN1 N2aN2 … NK aNK
where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤NK <⋯<N2 <N1 ≤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

#include <iostream>
#include <memory.h>
#include <vector>
#include <iomanip>

using namespace std;

const int maxn = 1002;

double a[maxn];
double b[maxn];

int main() {
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    int k1, k2;
    cin >> k1;
    for (int i = 0; i < k1; i++) {
        int n;
        double an;
        cin >> n >> an;
        a[n] = an;
    }
    cin >> k2;
    for (int i = 0; i< k2; i++) {
        int n;
        double an;
        cin >> n >> an;
        b[n] = an;
    }
    vector<pair<int, double> > ans;
    for (int i = maxn - 1; i >= 0; i--) {
        double sum = a[i] + b[i];
        if (sum != 0) {
            ans.push_back(make_pair(i, sum));
        }
    }
    cout << ans.size();
    for (size_t i = 0; i < ans.size(); i++) {
        cout << " " << ans[i].first << " " << setiosflags(ios::fixed) << setprecision(1) << ans[i].second;
    }
    return 0;
}