# 1009. Product of Polynomials (25)

400 ms

65536 kB

16000 B

Standard

CHEN, Yue

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>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int m,n;
int x;
int cnt=0;
double a[1005],b[1005],c[2010]={0};///a,b,c保存到都是该指数对应的系数
cin>>m;
for(int i=0;i<m;i++)
{
cin>>x;
cin>>a[x];
}
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
cin>>b[x];
}
for(int i=0;i<1001;i++)
{
for(int j=0;j<1001;j++)
{
c[i+j]+=a[i]*b[j];
}
}
for(int i=0;i<2010;i++)
{
if(c[i]!=0)
cnt++;
}
cout<<cnt;
for(int i=2002;i>=0;i--)
{
if(c[i]!=0)
printf(" %d %.1lf",i,c[i]);
}
return 0;
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：1009. Product of Polynomials (25) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)