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

Sample Code

#include<iostream>
#include<iomanip>
using namespace std;
int main(){
    double a[2001];
    double b[2001];
    int count1,count2;
    int e;
    double k;
    for(int i=0;i<2001;i++){
        a[i]=0;
        b[i]=0;
    }
    /*for(int i=0;i<max;i++){
        cout<<a[i];
    }*/
    cin>>count1;
    for(int i=0;i<count1;i++){
        cin>>e>>k;
        a[e]=k;
    }
    cin>>count2;

    for(int i=0;i<count2;i++){
        cin>>e>>k;
        for(int j=0;j<2001;j++){
            if(a[j]!=0){
                b[j+e]+=k*a[j];
                //cout<<b[j+e]<<" "<<endl;
            }
        }
    }
     int count=0;
    for(int i=0;i<2001;i++){
        if(b[i]!=0){
            count++;
        }
    }
    
        cout<<count<<" ";
        for(int i=2000;i>=0;i--){
            if(b[i]!=0){
                cout<<i<<" "<<setprecision(1)<<fixed<<b[i];
                count--;
                if(count!=0){
                cout<<" ";
                }
            }

        }
   
    return 0;
}

---