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:
$KN1aN1N2aN2...NKaNK$
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\le K\le 10,0\le NK<\cdots <N2<N1\le 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>
#include<cstdio>
#include<iomanip>
using namespace std;
const int maxn=2002;
struct node{
   int exp;
   double coef;
}Node[11];
double ans[maxn];
int main(){
   int k;
   cin>>k;
   for(int i=0;i<k;i++){
      cin>>Node[i].exp>>Node[i].coef;
   }
   int k1;
   cin>>k1;
   for(int i=0;i<k1;i++){
      int exp;double coef;
      cin>>exp>>coef;
      for(int j=0;j<k;j++){
         int n=Node[j].exp+exp;
         double a=Node[j].coef*coef;
         ans[n]+=a;
      }
   }
   int cnt=0;
   for(int i=0;i<maxn;i++){
      if(ans[i]!=0){
         cnt++;
      }
   }
   cout<<cnt;
   for(int i=maxn-1;i>=0;i--){
      if(ans[i]!=0){
         printf(" %d %.1f",i,ans[i]);
      }
   }
   cout<<endl;
   return 0;
}