1002. A+B for Polynomials (25) PAT 甲级

最新推荐文章于 2025-10-03 14:25:30 发布

原创最新推荐文章于 2025-10-03 14:25:30 发布 · 323 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT

PAT 甲级专栏收录该内容

118 篇文章

订阅专栏

本文介绍了一个简单的算法，用于计算两个多项式的和，并给出了相应的C++实现代码。输入为两个多项式，每个多项式由一系列非零项组成，输出为这两个多项式的和，格式与输入相同。

Problem Description

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 aN1 N2 aN2 … 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

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<iomanip>
using namespace std;


#define MAX_N 1011

double p[MAX_N];


int main(){
    int k;
    double a;
    int n;
    int count=0;
    cin>>k;
    while(k--){
        cin>>n>>a;
        p[n]+=a;
    }

    cin>>k;
    while(k--){
        cin>>n>>a;
        p[n]+=a;
    }

    for(int i=0;i<MAX_N;i++){
        if(p[i]!=0) count++;
    }

    cout<<count;
    for(int i=MAX_N-1;i>=0;i--){
        if(p[i]!=0) {
            cout<<" "<<i<<" ";
            cout<<fixed<<setprecision(1)<<p[i];
        }
    }

}