PAT-甲级-1009 Product of Polynomials (25 分)

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:

K N​1​​ a​N​1​​​​ N​2​​ a​N​2​​​​ ... N​K​​ a​N​K​​​​

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≤K≤10, 0≤N​K​​<⋯<N​2​​<N​1​​≤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

题目大意：计算多项式A*B;
解题思路：

• 指数用int型变量，系数用double型数组；
• double的下标即为指数；
• 计算公式：b[ j + e ] += tmp * a[j]; 
• 注意：当系数为0.0时，不输出。

#include <iostream>
using namespace std;
#define rep(i,j,k)    for(int i=j;i<k;i++)
const int maxn=1001;

int main(){
    int m,n,e,c,cnt=0;
    double a[maxn]={0.0},b[2*maxn]={0.0},tmp;
    scanf("%d",&m);
    rep(i,0,m){
        scanf("%d",&e);
        scanf("%lf",&a[e]);
    }
    scanf("%d",&n);
    rep(i,0,n){
        scanf("%d %lf",&e,&tmp);
        rep(j,0,maxn){
            b[j+e] += tmp * a[j];
        }
    }
    rep(i,0,2*maxn){
        if(b[i] != 0.0)
            cnt++;
    }
    printf("%d",cnt);
    for(int i=2*maxn-1;i>=0;i--){
        if(b[i] != 0.0)
            printf(" %d %.1f",i,b[i]);
    }
    return 0;
}