# 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

#include<cstdio>
struct poly
{
int exp;
double cof;
}p[1001];

const int MAXN = 2001;
double res[MAXN];

int main(int argc, char const *argv[])
{
int N,M,count=0;

scanf("%d", &N);
for (int i = 0; i < N; ++i)
{
scanf("%d%lf", &p[i].exp, &p[i].cof);
}

scanf("%d", &M);
for (int i = 0; i < M; ++i)
{
int n;
double a;
scanf("%d%lf", &n ,&a);
for (int i = 0; i < N; ++i)
{
res[p[i].exp+n] += p[i].cof*a;
}

}

for (int i = 0; i < MAXN; ++i)
{
if(res[i] != 0.0 ) count++;
}
printf("%d",count);
for (int i = MAXN; i >= 0 ; --i)
{
if(res[i] != 0.0) {
if(count != 0) printf(" ");
printf("%d %.1f", i, res[i]);
count--;
}
}

printf("\n");

return 0;
}