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 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 <cstdio>
#include <cstring>
int main()
{
	double n1[1010], n2[1010], ans[2020];
	memset(n1, 0, 1010 * sizeof(double));
	memset(n2, 0, 1010 * sizeof(double)); 
	memset(ans, 0, 2020 * sizeof(double));
	
	int k, ex;
	scanf("%d", &k);
	for(int i = 0; i < k; i++)
	{
		scanf("%d", &ex);
		scanf("%lf", &n1[ex]);
	}
	scanf("%d", &k);
	for(int i = 0; i < k; i++)
	{
		scanf("%d", &ex);
		scanf("%lf", &n2[ex]);
	}

	for(int i = 1000; i >= 0; i--)
	{
		for(int j = 1000; j >= 0; j--)
		{
			ans[i+j] += n1[i] * n2[j];
		}
	}
	k = 0;
	for(int i = 2000; i >= 0; i--)
		if(ans[i] != 0.0)
			k++;			
	printf("%d", k);
	for(int i = 2000; i >= 0; i--)
	{
		if(ans[i] != 0.0)
			printf(" %d %.1lf", i, ans[i]);
	}
	
	return 0;
}