PAT A1009 Product of Polynomials

1009 Product of Polynomials

分数 25

作者 CHEN, Yue

单位 浙江大学

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>
#include <cstring>
#include <algorithm>
#include <iomanip>

using namespace std;

typedef pair<int,double> PID;
const int maxn = 15;
PID A[maxn], B[maxn], C[maxn * maxn],res[maxn * maxn];

int main()
{
    int n, m;
    cin >> n;
    
    for(int i=0; i<n; ++i)
        cin >> A[i].first >> A[i].second;
    cin >> m;
    for(int i=0;i<m;++i)
        cin >> B[i].first >> B[i].second;
      
    //两个多项式相乘
    int idx = 0;
    for(int i=0;i<n;++i)
        for(int j=0;j<m;++j)
        {
            int exp = A[i].first + B[j].first;
            double pos = A[i].second * B[j].second;
            if(pos != 0)
                C[idx++] = {exp, pos};
        }
      
    //相乘结果排序
    sort(C, C+idx);
    
    //结果去重
    int index = 0;
    for(int i=0;i<idx;++i)
    {
        double pos = C[i].second;
        while(C[i+1].first == C[i].first)
        {
            ++i;
            pos += C[i].second;
        }
        
        if(pos != 0)
            res[index++] = {C[i].first,pos};
    }
    
    cout << index ;
    for(int i=index-1; i>=0; --i)
        printf(" %d %.1f",res[i].first,res[i].second);
    return 0;
}