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 N1 a~N1~ N2 a~N2~ … NK a~NK~, where K is the number of nonzero terms in the polynomial, Ni and a~Ni~ (i=1, 2, …, K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10, 0 <= NK < … < N2 < N1 <=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 <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
struct node
{
int exp;
double coef;
}a[1005];
double ans[2005];
int main(int argc, char const *argv[])
{
int k;
cin>>k;
for (int i = 0; i < k; ++i)
{
cin>>a[i].exp>>a[i].coef;
}
int t;
cin>>t;
for (int j = 0; j < t; ++j)
{
int e;
double c;
cin>>e>>c;
for (int i = 0; i < k; ++i)
{
ans[e+a[i].exp] += (a[i].coef*c);
}
}
int cnt = 0;
for (int i = 0; i < 2005; ++i)
{
if(ans[i])
cnt++;
}
cout<<cnt;
for (int i = 2005; i >= 0; --i)
{
if(ans[i])
printf(" %d %.1f", i,ans[i]);
}
cout<<endl;
return 0;
}