pat甲1009. 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

tips:求两个一元多项式的乘积

水题，直接上代码

#include<map>
#include<iostream>
#include<cmath>
using namespace std;
map<int,double> ans;
const double eps=1e-3;
int main()
{
	map<int,double>m1,m2; 
	int m,n,x;double y;
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>x>>y;
		m1[x]=y;
	}
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>x>>y;
		m2[x]=y;
	}
	
	for(auto it1=m1.begin();it1!=m1.end();it1++)
		for(auto it2=m2.begin();it2!=m2.end();it2++)
		{
			ans[it1->first+it2->first]+=(it1->second*it2->second);
			if(abs(ans[it1->first+it2->first])<eps)ans.erase(it1->first+it2->first);
		}
	
	cout<<ans.size();
	for(auto it=ans.rbegin();it!=ans.rend();it++)
		printf(" %d %.1lf",it->first,it->second);
		//cout<<" "<<it->first<<" "<<it->second;
	
	 
	return 0;
}