PAT练习题 1009 Product of Polynomials（25分）多项式乘法

传送门：1009

---

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​₁​​ a​N1 N​₂​​ a​N​2 … N​_K​​ a​N​K
​​
where K is the number of nonzero terms in the polynomial, N_​i and aN_i​​
​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10, 0≤N​_K<⋯<N​₂<N₁≤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

---

模拟多项式乘法即可

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
double b,A[1001],B[2001];
int n1, n2, a, cnt = 0;
int main()
{
	scanf("%d", &n1);
	for(int i = 0; i < n1; i++)
  	{
		scanf("%d %lf", &a, &b);
		A[a] = b;
	}
	scanf("%d", &n2);
	for(int i = 0; i < n2; i++)
  	{
		scanf("%d %lf", &a, &b);
		for(int j = 0; j < 1001; j++)
			B[j + a] += A[j] * b;
	}
	for(int i = 2000; i >= 0; i--)
  	{
		if(B[i] != 0.0)
    	{
			cnt++;
		}
	}
	printf("%d", cnt);
	for(int i = 2000; i >= 0; i--)
  	{
		if(B[i] != 0.0)
    	{
			printf(" %d %.1f", i, B[i]);
		}
	}
	return 0;
}