1009 Product of Polynomials

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

代码长度限制

16 KB

时间限制

400 ms

内存限制

64 MB

栈限制

8192 KB

#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
	int a, n1, n2;
	double b, arr[1001] = { 0.0 }, ans[2001] = { 0.0 };
	
	cin >> n1;
	for (int i = 0; i < n1; i++) {
		cin >> a >> b;
		arr[a] = b;
	}

	cin >> n2;
	for (int i = 0; i < n2; i++) {
		cin >> a >> b;
		for (int j = 0; j < 1001; j++) {
			ans[j + a] += arr[j] * b;
		}
	}

	int count = 0;
	for (int i = 2000; i >= 0; i--) {
		if (ans[i] != 0.0)count++;
	}
	cout << count;

	for (int i = 2000; i >= 0; i--) {
		if (ans[i] != 0.0)cout << " " << i << " " <<fixed<< setprecision(1) << ans[i];
	}

	return 0;
}