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<iostream>
using namespace std;
struct Polynomials{
	int exponents;
	double coefficients;
};
struct Polynomials p1[20];
//注意此处，本想题目告知指数最大为1000，但是在多项式相乘时指数最大可达到2000 ,由于开始时数组大小不合适所以导致段错误 
struct Polynomials res[2010];
void Initial(){
	for(int i=0;i<2010;i++){
		res[i].exponents=-1;
	}
}
int main(){
	int pnum1,pnum2;
	int exp;
	double coe;
	double c;
	int e;
	int count=0;
	while(scanf("%d",&pnum1)!=EOF){
		Initial();
		count=0;
		//读入第一个多项式 
		for(int i=0;i<pnum1;i++){
			cin>>p1[i].exponents>>p1[i].coefficients;  
		}
		cin>>pnum2;
		for(int i=0;i<pnum2;i++){//逐个读入第二个多项式的值 
			cin>>exp>>coe;
		    for(int j=0;j<pnum1;j++){
		    	e=exp+p1[j].exponents;//相乘结果的指数 
				c=coe*p1[j].coefficients;//相乘结果的系数
				if(c!=0){
				     if(res[e].exponents==-1){
					     count++;
					     res[e].exponents=e;
					     res[e].coefficients=c;  
				     } 
				     else{
					     res[e].coefficients+=c;  
					     if(res[e].coefficients==0){
					     	count--;
					     	res[e].exponents=-1;  
						 }
				     } 	
			   }
			}	
		}
		cout<<count;
		for(int i=2009;i>=0;i--){
			if(res[i].exponents>=0){
				 printf(" %d %.1f",res[i].exponents,res[i].coefficients); 
			}
		} 
		cout<<endl;
	}
	return 0;
}