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 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 Input2 1 2.4 0 3.2 2 2 1.5 1 0.5Sample Output
3 3 3.6 2 6.0 1 1.6
#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
double a[1005]={0},b[1005]={0},ans[2005]={0};
int n,exp,cnt=0;
double coe;
cin >> n;
while(n--)
{
cin >> exp >> coe;
a[exp]=coe;
}
cin >> n;
while(n--)
{
cin >> exp >> coe;
b[exp]=coe;
}
for(int i=0;i<=1000;i++)
{
if(a[i]!=0)
{
for(int j=0;j<=1000;j++)
{
if(b[j]!=0)
{
ans[i+j]+=a[i]*b[j];
}
}
}
}
for(int i=2000;i>=0;i--)
{
if(ans[i]>1e-6||ans[i]<-1e-6)
{
cnt++;
}
}
cout << cnt;
for(int i=2000;i>=0;i--)
{
if(ans[i]>1e-6||ans[i]<-1e-6)
{
cout << ' ' << i << ' ' << setiosflags(ios::fixed) << setprecision(1) << ans[i];
}
}
return 0;
}