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 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 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>
#include <iomanip>

using namespace std;

int main()
{
    int n, exp, counter;
    double coe;
    double a[1002] = {0};
    double b[2005] = {0};
    cin >> n;
    while(n--)
    {
        cin >> exp >> coe;
        a[exp] = coe;
    }
    cin >> n;
    while(n--)
    {
        cin >> exp >> coe;
        for(int i=0; i<1002; i++)
        {
            b[exp+i] += coe*a[i];
        }
    }
    counter = 0;
    for(int i=0; i<2004; i++)
    {
        if(b[i] != 0)
        {
            counter++;
        }
    }
    cout << counter;
    for(int i=2004; i>=0; i--)
    {
        if(b[i] != 0)
        {
            cout << " " << i << " " << setprecision(1) << fixed << b[i];
        }
    }
    return 0;
}