1009. Product of Polynomials (25)

1. Product of Polynomials (25)
   时间限制
   400 ms
   内存限制
   65536 kB
   代码长度限制
   16000 B
   判题程序
   Standard
   作者
   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 <stdio.h>
int i, j, k, k1, index, index1, cnt = 0;
float num = 0, num1 = 0;
float a[3000] = {0}, a1[3000] = {0}, a3[3000] = {0};
int main() {
    scanf("%d", &k);
    for (i = 0; i < k; i++) {
        scanf("%d%f", &index, &num);
        a[index] = num;
    }
    scanf("%d", &k1);
    for (i = 0; i < k1; i++) {
        scanf("%d%f", &index1, &num1);
        a1[index1] = num1;
    }
    for (i = 0; i < 3000; i++) {
        for (j = 0; j < 3000; j++) {
            if (a[i] != 0 && a1[j] != 0)
                a3[i+j] += a[i] * a1[j];
        }
    }
    for (i = 0; i < 3000; i++) {
        if (a3[i] != 0)
            cnt++;
    }
    printf("%d", cnt);
    for (i = 3000; i >= 0; i--) {
        if (a3[i] != 0) {
            printf(" %d %.1f", i, a3[i]);
        }
    }
    return 0;
}