1009. Product of Polynomials (25)

最新推荐文章于 2020-04-05 19:30:58 发布

zju_lemon

最新推荐文章于 2020-04-05 19:30:58 发布

阅读量382

点赞数

本文链接：https://blog.csdn.net/matrixa17/article/details/18864043

版权

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

参考代码：

#include <iostream>
#include <iomanip>
using namespace std;

int main()
{
    double a[1001]={0},b[1001]={0},c[2002]={0};
    int m,n;
    cin>>m;
    for(int i=0;i<m;i++){
        int flag = 0;
        cin>>flag;
        cin>>a[flag];
    }
    cin>>n;
    for(int i=0;i<n;i++){
        int flag = 0;
        cin>>flag;
        cin>>b[flag];
    }
    for(int i=0;i<1001;i++){
        for(int j=0;j<1001;j++){
            c[i+j] += a[i]*b[j];
        }
    }
    int countNum = 0;
    for(int i=2001;i>=0;i--){
        if(c[i]!=0){
            countNum++;
        }
    }
    cout<<countNum;
    for(int i=2001;i>=0;i--){
        if(c[i]!=0){
            cout<<" "<<i<<" "<<fixed<<setprecision(1)<<c[i];
        }
    }
    return 0;
}