PAT 甲级 1009. Product of Polynomials （Map）

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 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (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

当系数为0，那么这个不是项，要排除，不然只有20分

#include <iostream>
#include "cstring"
#include <stdio.h>
#include "iomanip"
#include "vector"
#include "cmath"
#include "stack"
#include "algorithm"
#include <math.h>
#include "map"
#include "queue"
using namespace std;

int main()
{
 
    map<int,double> a,b,t;
    int n,e;
    double c;
    cin>>n;
    while(n--)
    {
        cin>>e>>c;
        a[e]=c;
    }
    cin>>n;
    while(n--)
    {
        cin>>e>>c;
        b[e]=c*1.0;
    }
     for(map<int,double >::iterator it=a.begin()  ;it!=a.end();it++)
     {
         for(map<int,double>::iterator it2=b.begin();it2!=b.end();it2++ )
         {

                t[it->first+it2->first]+=it->second*it2->second*1.0;

         }
     }
     int size=0;
     for(map<int,double >::reverse_iterator it=t.rbegin()  ;it!=t.rend();it++)

    {

        if(it->second!=0)
            size++;
    }
      cout<<size;
     for(map<int,double >::reverse_iterator it=t.rbegin()  ;it!=t.rend();it++)

    {
        if(it->second!=0)
        cout<<" "<< it->first<<" "<<fixed<<setprecision(1)<<it->second;
    }


}