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<iostream>
using namespace std;
const int M=1010;
double a[M],b[M],c[M*2];
int main()
{
//输入数据
int n;
cin>>n;
while(n--)
{
int d;
double e;
cin>>d>>e;
a[d]=e;
}
cin>>n;
while(n--)
{
int d;
double e;
cin>>d>>e;
b[d]=e;
}
//做乘法
for(int i=0;i<M;i++)
for(int j=0;j<M;j++)
c[i+j]+=a[i]*b[j];
//计算有多少项
int cnt=0;
for(auto x:c)
if(x)
cnt++;
cout<<cnt;
//输出每一项
for(int i=2*M-1;i>=0;i--)
if(c[i])
printf(" %d %.1f",i,c[i]);
return 0;
}
就是多项式乘法。