PAT-A-1009 Product of 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 product 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 up to 1 decimal place.

Sample Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:
3 3 3.6 2 6.0 1 1.6

• 题目大意：
  给出两个多项式，其中K表示多项式中非零项的个数， N_i 是指数， _aNi是系数，例如：2 1 2.4 0 3.2 表示多项式共有2项，为 2.4 * x¹ + 3.2 * x⁰, 要求这两个多项式的乘积；

• 思路：

1. 两个多项式相乘，就是将一个多项式中的每一项，都分别与另一个多项式中的每一项相乘，即（a + b）*（c + d）= a * c + a * d + b * c + b * d；
2. 两项相乘的结果，为系数相乘，指数相加，即(a * x^m) * (b * xⁿ) = (a * b) x ^{(m + n)}；

#include <iostream>
using namespace std;
int a, k, cnt = 0;
double b, poly[1001] = {0.0}, ans[2001] = {0.0};
int main()
{
    cin >> k;
    while (k-- > 0)
    {
        scanf("%d %lf", &a, &b);
        poly[a] = b;
    }
    cin >> k;
    while (k-- > 0)
    {
        scanf("%d %lf", &a, &b);
        for (int i = 0; i < 1001; i++)
        {
            ans[i + a] += poly[i] * b;
        }
    }
    for (int i = 0; i < 2001; i++)
    {
        cnt += ans[i] == 0.0 ? 0 : 1; 
    }
    cout << cnt;
    for (int i = 2000; i >= 0; i--)
    {
        if (ans[i] != 0.0)
        { 
            printf(" %d %.1lf", i, ans[i]);
        }
    }
    return 0;
}