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 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 <cstdio>
using namespace std;

int main()
{
    freopen("in.txt","r",stdin);
    int k;
    double poly[2000+10]{0.0};
    double poly_sum[2000+10]{0.0};
    int sum=0;
    scanf("%d",&k);
    for(int i=0;i<k;i++){
        int exp;
        double cof;
        scanf("%d %lf",&exp,&cof);
        poly[exp]=cof;
    }
    scanf("%d",&k);
    for(int i=0;i<k;i++){
        int exp;
        double cof;
        scanf("%d %lf",&exp,&cof);
        for(int j=0;j<2010;j++){
            if(poly[j]!=0.0){
                if(poly_sum[j+exp]==0.0)//新增的非0项
                    sum++;
                poly_sum[j+exp]+=poly[j]*cof;
                if(poly_sum[j+exp]==0.0)//加完后该项为0,故去掉
                    sum--;
            }
        }
    }
    printf("%d",sum);
    for(int i=2009;i>=0;i--){
        if(poly_sum[i]!=0.0){
            printf(" %d %.1f",i,poly_sum[i]);
        }
    }
    return 0;
}

要注意开的数组要足够大，开到2000，不然会报段错误，还有在判断非零项个数时，要注意题目未交待系数为正，故存在乘完后某项变为0的情况，此时非零项个数要减一