1009. Product of Polynomials (25)（C++)

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

 

多项式乘法;

Tips:原多项式指数最大为1000，相乘后最大为2000；

 

#include <vector>
#include <set>
#include <iostream>
using namespace std;
int main(){
    int k1,k2;
    std::vector<double> v(1005,0),resultv(2005,0);
    set<int,greater<int>>s,results;
    scanf("%d",&k1);
    for(int i=0;i<k1;i++){
        int temp;
        scanf("%d",&temp);
        scanf("%lf",&v[temp]);
        s.insert(temp);
    }
    scanf("%d",&k2);
    for(int i=0;i<k2;i++){
        int temp;
        double tempf;
        scanf("%d %lf",&temp,&tempf);
        for(auto it=s.begin();it!=s.end();it++){
            resultv[*it+temp]+=v[*it]*tempf;
            results.insert(*it+temp);
            if(resultv[*it+temp]==0)
                results.erase(*it+temp);
        }
    }
    printf("%d",results.size());
    for(auto it=results.begin();it!=results.end();it++){
        printf(" %d %.1f",*it,resultv[*it]);
    }
}