- 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 N1 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (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 <bits/stdc++.h>
using namespace std;
double ma[2231];
double mb[2231];
double mc[5231];
int main()
{
int n, m, x;
scanf("%d", &n);
memset(ma, 0, sizeof(ma));
memset(mb, 0, sizeof(mb));
memset(mc, 0, sizeof(mc));
for(int i=0;i<n;i++)
{
scanf("%d", &x);
scanf("%lf", &ma[x]);
}
scanf("%d", &m);
for(int i=0;i<m;i++)
{
scanf("%d", &x);
scanf("%lf", &mb[x]);
}
for(int i=0;i<=1000;i++)
{
for(int j=0;j<=1000;j++)
{
mc[i+j] += ma[i] * mb[j];
}
}
int ans = 0;
for(int i=0;i<=2010;i++)
{
if(mc[i]!=0)
{
ans++;
}
}
printf("%d", ans);
for(int i=2010;i>=0;i--)
{
if(mc[i]!=0)
{
printf(" %d %.1lf", i, mc[i]);
}
}
printf("\n");
return 0;
}