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<iomanip>
#include<functional>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<map>
#include<list>
#include<set>
using namespace std;
int main()
{
	int k, a, i;
	double x;
	map<int, double> result, one;
	cin >> k;
	for (i = 0; i < k; i++)
	{
		cin >> a >> x;
		one[a] = x;
	}
	cin >> k;
	for (i = 0; i < k; i++)
	{
		cin >> a >> x;
		for (map<int, double>::iterator it = one.begin(); it != one.end(); it++)
		{
			if (result.count(a + it->first) == 0)result[a + it->first] = x * it->second;
			else result[a + it->first] += x * it->second;
			if (result[a + it->first] == 0)result.erase(a + it->first);
		}
	}
	cout << result.size();
	for (map<int, double>::reverse_iterator it1 = result.rbegin(); it1 != result.rend(); it1++)
		cout << ' ' << it1->first << ' ' << fixed << setprecision(1) << it1->second;
	return 0;
}