PAT A1009. Product of Polynomials

1009. 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 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 <stdio.h>


int main() {
double num1[1001] = {
0
};
double num2[1001] = {
0
};
double result[2001] = {
0
};
int K1, K2, i, j, index, count;
double temp;
scanf("%d", &K1);
for(i = 0; i < K1; i ++) {
scanf("%d%lf", &index, &temp);
num1[index] = temp;
}
scanf("%d", &K2);
for(i = 0; i < K2; i ++) {
scanf("%d%lf", &index, &temp);
num2[index] = temp;
}
for(i = 0; i <= 1000; i ++) {
if(num1[i] == 0) {
continue;
}
for(j = 0; j <= 1000; j ++) {
if(num2[j] == 0) {
continue;
}
result[i + j] += num1[i] * num2[j];
}
}
for(i = 2000, count = 0; i >= 0; i --) {
if(result[i] != 0) {
count ++;
}
}
printf("%d ", count);
for(i = 2000; i >= 0; i --) {
if(result[i] != 0) {
printf("%d %.1f", i, result[i]);
count --;
if(count != 0) {
printf(" ");
}
}
}
return 0;
}