PAT A1002

1002 A+B for Polynomials (25)（25 分）

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

多项式求和,程序参考算法笔记。

#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    const int max_n=1111;
    double p[max_n]={};
    int m,n,count=0;
    float a;
    scanf("%d",&m);
    for(int i=0;i<m;i++){
        //scanf("%d %1f",&n,&a);
            cin>>n>>a;//对于字符：cin的输入忽略空格和回车。scanf("%c",&i)等价于i = getchar()，换行符和回车都会被读入。
        p[n]+=a;
    }
    scanf("%d",&m);
    for(int i=0;i<m;i++){
        cin>>n>>a;
        p[n]+=a;
    }
    for(int i=0;i<max_n;i++)
        if(p[i]!=0)
            count++;
    printf("%d",count);
    for(int i=max_n-1;i>=0;i--)
        if(p[i]!=0)
            printf(" %d %.1f",i,p[i]);
    return 0;
}