本文共 1288 字，大约阅读时间需要 4 分钟。

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 N​1a​N1N​2aN​2… NKaNKwhere K is the number of nonzero terms in the polynomial, Ni and a​N​i(i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10, 0≤N​K<⋯<N​2<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

题意：多项式乘法最终输出非零项的个数和非零项。

思路：用2个数组用来存储各个项，最后用第3个数组存储输出项即可。

#include
   
    using namespace std;#define MAX 2500int main(){   	int k1,mp1=-1,mp2=-1,n,i;	double p,po1[MAX],po2[MAX],po3[MAX];	cin>>k1;	for(i=0;i
    
     mp1) mp1=n;	}	cin>>k1;	for(i=0;i
     
      mp2) mp2=n;	}	k1=-1;	for(i=mp1;i>=0;i--)	{   			n=0;		for(int j=mp2;j>=0;j--)		{   			n=i+j;			if(n>k1) k1=n;			po3[n]+=po1[i]*po2[j];		}	}	n=0;	for(i=k1;i>=0;i--)	{   		if(po3[i]!=0)		{   			n++;		}	}	cout<
      
       =0;i--)	{   		if(po3[i]!=0)		{   			printf(" %d %.1lf",i,po3[i]);		}	}	return 0;}