PAT 1009 Product of Polynomials（模拟多项式相乘）

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:

KN1aN1N2aN2 ... NKaNK

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.

模拟多项式乘法，与第1002相似，给出两组多项式K N1aN1 N2aN2 ... NKaNK，K为多项式的项数，N为多项式的指数，aN为多项式的系数，求两个多项式相乘的结果

C++代码如下：

#include<iostream>
using namespace std;
#define minsize 10
#define maxsize 2001
float data1[minsize]={0};
float data2[minsize]={0};
float data3[maxsize]={0};
int k1[minsize]={0};
int k2[minsize]={0};
int main()
{
    int n1,n2;
    int k;
    float d;
    cin>>n1;
    for(int i=0;i<n1;i++){
        cin>>k>>d;
        k1[i]=k;
        data1[i]=d;
    }
    cin>>n2;
    for(int i=0;i<n2;i++){
        cin>>k>>d;
        k2[i]=k;
        data2[i]=d;
    }
    for(int i=0;i<n1;i++){
        for(int j=0;j<n2;j++){
            data3[k1[i]+k2[j]]+=data1[i]*data2[j];
        }
    }
    int sum=0;
    for(int i=0;i<maxsize;i++)
        if(data3[i]!=0)
            sum++;
    printf("%d",sum);
    for(int i=maxsize;i>=0;i--)
        if(data3[i]!=0){
            printf(" %d %.1lf",i,data3[i]);
        }
    return 0;
}

样例结果如下：