PTA甲1009 Product of Polynomials (25 point(s))

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

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 <stdio.h>
#include <stdlib.h>
double fipoly[1001]={0};
double poly[2001]={0};
int main()
{
    int n,m;
    int exp;
    double coe;
    scanf("%d",&n);
    int fiexp[n];
    for(int i=0;i<n;i++){
        scanf("%d %lf",&exp,&coe);
        fiexp[i]=exp;
        fipoly[exp]+=coe;
    }
    int cnt=0;
    scanf("%d",&m);
    for(int i=0;i<m;i++){
        scanf("%d %lf",&exp,&coe);
        for(int j=0;j<n;j++){
            int muexp=exp+fiexp[j];
            double mucoe=coe*fipoly[fiexp[j]];
            poly[muexp]+=mucoe;
        }
    }
    for(int i = 2000; i >= 0; i--)
        if(poly[i] != 0.0) cnt++;
    printf("%d",cnt);
    for(int i=2000;i>=0;i--){
        if(poly[i]!=0.0)
            printf(" %d %.1f",i,poly[i]);
    }
    printf("\n");
    return 0;
}