PAT 甲级 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

Accepted Code

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int n1, n2, a, cnt;
 4 double b, arr[1001] = {0.0}, ans[2001] = {0.0};
 5 
 6 int main()
 7 {
 8     cin >> n1;
 9     for(int i = 0; i < n1; i ++)
10     {
11         cin >> a >> b;
12         arr[a] = b;
13     }
14     cin >> n2;
15     for(int i = 0; i < n2; i ++)
16     {
17         cin >> a >> b;
18         for(int j = 0; j < 1001; j ++)
19             ans[j + a] += arr[j] * b;
20     }
21     for(int i = 0; i <= 2000; i ++)
22         if(ans[i] != 0.0) cnt ++;
23     cout << cnt;
24     for(int i = 2000; i >= 0; i --)
25         if(ans[i] != 0.0)
26             cout << " " << i << " " << fixed << setprecision(1) << ans[i];
27     return 0;
28 }