1002. A+B for Polynomials (25)

1002. A+B for Polynomials (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

题意：

给你两个多项式，输出相加后的多项式

考点：

1. 格式化输出：setprecision();

坑点：

无

#include <iostream>
#include <iomanip>

using namespace std;

int main()
{
    double n[1001];
    int m, e;
    double c;
    
    for(int i = 0; i < 1001; i++) n[i] = 0;
    
    for(int t = 0; t < 2; t++)
    {
            cin >> m;
            for(int i = 0; i < m; i++)
            {
                  cin >> e >> c;
                  n[e] += c;
            }
    }
    
    int num = 0;
    
    for(int i = 0; i < 1001; i++)
            if(n[i] != 0) num++;
    cout << num;
    for(int i = 1000; i >= 0; i--)
            if(n[i] != 0) cout << " " << i << " " << setiosflags(ios::fixed) << setprecision(1) << n[i];
    cout << endl;
}