PAT (Advanced Level) Practice 1009 Product of Polynomials

1009 Product of Polynomials

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 ​1 ​​ a ​N ​1 ​​ ​​ N ​2 ​​ a ​N ​2 ​​ ​​ … N ​K ​​ a ​N
​K ​​ ​​

where K is the number of nonzero terms in the polynomial, N ​i ​​ 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 ​​ <N ​1 ​​
≤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

题意

多项式A和B相乘，求得结果，与输入格式相同输出（可参照1002题）

代码

#include<cstdio>
const int maxn=1111;
int main(){
	double a[maxn]={0},b[maxn]={0},c[2002]={0},t;
	int n,m,k,count=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d%lf",&k,&t);
		a[k]+=t;
	}
	scanf("%d",&m);
	for(int i=0;i<m;i++){
		scanf("%d%lf",&k,&t);
		b[k]+=t;
	}
	
	for(int i=0;i<1001;i++){
		for(int j=0;j<1001;j++){
			if(a[i]!=0&&b[j]!=0){
				k=i+j;
				t=a[i]*b[j];
				c[k]+=t;
			}
		}
	}
	
	for(int i=0;i<2002;i++){
		if(c[i]!=0){
			count++;
		}
	}
	printf("%d",count);
	for(int i=2002-1;i>=0;i--){
		if(c[i]!=0){
			printf(" %d %.1f",i,c[i]);
		}
	}
}