A1009. Product of Polynomials (25)

A1009

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

我的AC代码如下：

#include <cstdio>
double b[2005] = { 0 };
struct Poly {
    Poly() {
        e = 0;
        k = 0.0;
    }
    int e;
    double k;
};
Poly a[1005];
int main() {
    int n,e;
    double k;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        a[i] = Poly();
        scanf("%d%lf", &e, &k);
        a[i].e = e;
        a[i].k = k;
    }
    int m,tmp,count =0;
    double d;
    scanf("%d", &m);
    for (int i = 0; i < m; i++) {
        scanf("%d%lf", &e, &k);
        for (int j = 0; j < n; j++) {
            b[e + a[j].e] += k*a[j].k;
        }
    }
    //之所以拿出来统计个数，是因为很有可能相加后系数变为0
    for (int i = 0; i <= 2000; i++) {
        if (b[i] != 0) {
            count++;
        }
    }
    printf("%d", count);
    for (int i = 2000; i >= 0; i--) {
        if (b[i] != 0) {
            printf(" %d %.1f", i, b[i]);
        }
    }
    return 0;
}