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 aN1 N2 aN2 … NK aNK, 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.
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>
using namespace std;
float a[1500]={0},b[1500]={0},c[3000]={0};
int main(){
    freopen("in.txt","r",stdin);
    int t,n1,n2,m1=0,m2=0;
    scanf("%d",&n1);
    for(int i=0;i<n1;i++){
        scanf("%d",&t);
        m1=max(t,m1);
        scanf("%f",&a[t]);
    }
    scanf("%d",&n2);
    for(int i=0;i<n2;i++){
        scanf("%d",&t);
        m2=max(t,m2);
        scanf("%f",&b[t]);
    }
    int m3=0;
    for(int i=0;i<=m1;i++){
        for(int j=0;j<=m2;j++){
            t=i+j;
            m3=max(t,m3);
            c[t]+=a[i]*b[j];
        }
    }
    int cnt=0;
    for(int i=0;i<=m3;i++){
        if(c[i]!=0)
            cnt++;
    }
    printf("%d",cnt);
    for(int i=m3;i>=0;i--){
        if(c[i]!=0){
            printf(" %d %.1f",i,c[i]);
        }
    }
    return 0;
}