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
乘法和加法有所不同,多项式A的每一项都要和多项式B的每一项分别相乘,则需要新开辟一个数组,c[10000]来存储结果。每一项相乘时,系数相乘、指数相加, 并把这一项按照c[新指数]=新系数存储起来;此时要注意,c数组最小要开2000.
/*
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<string.h>
using namespace std;
double a[1001];
double b[1001];
double c[10000];
int count=0;
int main()
{
int N,M;
int zhishu;
double xishu;
scanf("%d",&N);
for(int i=0;i<N;i++)
{
scanf("%d %lf",&zhishu,&xishu);
a[zhishu]=xishu;
}
scanf("%d",&M);
for(int i=0;i<M;i++)
{
scanf("%d %lf",&zhishu,&xishu);
b[zhishu]=xishu;
}
for(int i=0;i<1001;i++)
{
if(a[i]!=0)
{ int z=i;
double x=a[i];
for(int j=0;j<1001;j++)
{ if(b[j]!=0)
{
int new_z;
double new_x;
new_z=j+z;
new_x=x*b[j];
c[new_z]+=new_x;
}
}
}
}
for(int i=0;i<10000;i++)
{
if(c[i]!=0)
count++;
}
printf("%d",count);
for(int i=9999;i>=0;i--)
{
if(c[i]!=0.0)
{
printf(" %d %.1f",i,c[i]);
}
}
}