PAT 甲级 1009 Product of Polynomials (25)（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 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 <iostream>
# include <algorithm>
using namespace std;
const int maxn = 2222;
double array1[maxn], array2[maxn];

int main(){
//	freopen("C:\\1.txt", "r", stdin);
	int n1, n2, e, count = 0;
	double c;
	fill(array1, array1 + maxn, 0.0);
	fill(array2, array2 + maxn, 0.0);
	scanf("%d", &n1);
	for(int i = 0; i < n1; i++){
		scanf("%d %lf", &e, &c);
		array1[e] = c;
	}
	scanf("%d", &n2);
	for(int i = 0; i < n2; i++){
		scanf("%d %lf", &e, &c);
		for(int j = 0; j < 1001; j++){
			array2[e + j] += array1[j] * c;
		}
	}

	for(int i = 0; i < maxn; i++){
		if(array2[i] != 0){
			count++; 
		}
	}
	printf("%d", count);
	for(int i = maxn; i >= 0; i--){
		if(array2[i] != 0){
			printf(" %d %.1lf", i, array2[i]);
		}
	}
	return 0;
}