PAT-A-1002 A+B for Polynomials (25分) C/C++实现（模拟）

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 N_{1 aN1} N_{2 aN2} … N_{n aNn}
where K is the number of nonzero terms in the polynomial, N_i
​ and _aNi (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1 ≤ K ≤ 10, 0 ≤ N_K<⋯< N₂ < N₁ ≤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

• 题目大意：
  计算多项式的和，输入为两个多项式，其中K表示多项式中非零项的个数， N_i 是指数， _aNi是系数，例如：2 1 2.4 0 3.2 表示多项式共有2项，为 2.4 * x¹ + 3.2 * x⁰

• 思路：

  1. 用一个长度为1001数组poly来表示多项式，i为指数，poly[i]为该指数项的系数；
  2. 多项式求和，只需将相同指数项的系数相加即可；

#include <iostream>
using namespace std;
double poly[1001] = {0};
int main()
{
    int k, cnt = 0;
    for (int i = 0; i < 2; i++)
    {
        cin >> k;
        while (k-- > 0)
        {
            int index;
            double cof;
            cin >> index >> cof;
            poly[index] += cof;
        }
    }
    for (int i = 0; i < 1001; i++)
    {
        if (poly[i] != 0)
        {
            cnt++;
        }
    }
    cout << cnt;
    for (int i = 1000; i >= 0; i--)
    {
        if (poly[i] != 0)
        {
            printf(" %d %.1lf", i, poly[i]); 
        }
    }
    return 0;
}