1009 Product of Polynomials (25 分) （多项式乘法）

This time, you are supposed to find A×BA\times BA×B where AAA and BBB 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:

KKK N1N_1N​1​​ aN1a_{N_1}a​N​1​​​​ N2N_2N​2​​ aN2a_{N_2}a​N​2​​​​ ... NKN_KN​K​​ aNKa_{N_K}a​N​K​​​​

where KKK is the number of nonzero terms in the polynomial, NiN_iN​i​​ and aNia_{N_i}a​N​i​​​​ (i=1,2,⋯,Ki=1, 2, \cdots , Ki=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤101\le K \le 101≤K≤10, 0≤NK<⋯<N2<N1≤10000 \le N_K < \cdots < N_2 < N_1 \le 10000≤N​K​​<⋯<N​2​​<N​1​​≤1000.

Output Specification:

For each test case you should output the product of AAA and BBB 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

题意：给出两个多项式A和B，求A*B的结果

分析：double类型的a数组保存第一组数据，ans数组保存结果。当输入第二组数据的时候，一边进行运算一边保存结果。最后按照指数递减的顺序输出所有不为0的项

注意：因为相乘后指数可能最大为2000，所以ans数组最大要开到2001

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n1,n2,ex,cnt=0;
	double co,ans[2005]={0.0},a[1005]={0.0};
	cin>>n1;
	while(n1--){
		scanf("%d %lf",&ex,&co);
		a[ex]=co;
	}
	cin>>n2;
	while(n2--){
		scanf("%d %lf",&ex,&co);
		for(int i=0;i<1001;i++)
			ans[i+ex]+=a[i]*co;
	}
	for(int i=0;i<2001;i++)
		if(ans[i]!=0.0) cnt++;
	cout<<cnt;
	for(int i=2000;i>=0;i--)
		if(ans[i]!=0.0) printf(" %d %.1f",i,ans[i]); 
	return 0;
}