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 N​1​​ a​N​1​​​​ N​2​​ a​N​2​​​​ ... N​K​​ a​N​K​​​​

where K is the number of nonzero terms in the polynomial, N​i​​ and a​N​i​​​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10, 0≤N​K​​<⋯<N​2​​<N​1​​≤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<vector>
#include<iostream>
#include <algorithm>
#include <math.h>
#include <iomanip>
using namespace std;

int main(){
    int k1,k2,temp,count=0;
    int index[1001];
    double kn[1001];
    vector<double>sum(2001,0);
    cin>>k1;
    for(int i=0;i<k1;i++){
        cin>>index[i]>>kn[i];
    }
    cin>>k2;
    for(int j=k1;j<k1+k2;j++){
        cin>>index[j]>>kn[j];  //把两列sample input存在一起
    }
    for(int i=0;i<k1;i++)
        for(int j=k1;j<k1+k2;j++){ //两层循环，系数相乘，指数相加，存入最终数组，下标对应指数
            temp=index[i]+index[j];
            sum[temp]+=kn[i]*kn[j];
        }
    for(int k=2000;k>=0;k--){
        if(sum[k]!=0)
            count++;  //计算总非零系数项
    }
    cout<<count;
    for(int k=2000;k>=0;k--){
        if(sum[k]!=0){
            cout<<" "<<k<<" "<<fixed<<setprecision(1)<<sum[k]; //保留一位小数
        }
    }
}