【PAT (Advanced Level) Practice】1009 Product of Polynomials (25 分)题解

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 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 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

结尾无空行

#include <iostream>

using namespace std;

struct poly
{
    int location;
    double num;
};
int main()
{
    int K1,K2,N,max = 0,count = 0;
    double aN,c[2000] = {0.0};
    cin >> K1;
    struct poly a[K1];
    for (int i = 0;i < K1;i++)
    {
        cin >> N >> aN;
        a[i].location = N;
        a[i].num = aN;
    }
    cin >> K2;
    struct poly b[K2];
    for (int i = 0;i < K2;i++)
    {
        cin >> N >> aN;
        b[i].location = N;
        b[i].num = aN;
    }
    for (int i = 0;i < K1;i++)
    {
        for (int j = 0;j < K2;j++)
        {
            int k = a[i].location+b[j].location;
            if (k >= max) max = k;
            c[k] += a[i].num*b[j].num;
        }
    }
    for (int i = 0;i < max+1;i++)
    {
        if (c[i] != 0) count++;
    }
    cout << count;
    for (int i = max;i > -1;i--)
    {
        if (c[i] != 0) printf(" %d %.1f",i,c[i]);
    }
    return 0;
}