1009 Product of Polynomials (25分)

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 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

 

 

/*
无坑点，直接模拟即可，结果数组需要超过2000 
*/
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(){
	freopen("input.txt","r",stdin);
	double a[2005] = {0.0},b[1005],c[1005];
	int n;
	scanf("%d",&n);
	for(int i = 0;i < n;i++){
		int t;
		double temp;
		cin>>t>>temp;
		b[t] = temp;
	}
	scanf("%d",&n);
	for(int i = 0;i < n;i++){
		double temp;
		int t;
		cin>>t>>temp;
		c[t] = temp;
	}
	for(int i = 0;i <= 1000;i++){
		for(int j = 0;j <= 1000;j++){
			a[i+j] += b[i]*c[j];
		}
	}
	int sum = 0;
	for(int j = 0;j < 2005;j++){
		if(a[j] != 0.0){
			sum++;
		}
	}
	printf("%d",sum);
	for(int j = 2001;j >= 0;j--){
		if(a[j] != 0.0){
			printf(" %d %.1f",j,a[j]);
		}
	}	
	return 0;
}