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 a_N1 N2 a_N2 ... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (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 <iomanip> 
using namespace std;
int main()
{
	int n,m,index;
	double a[1001]={0};
	double b[1001]={0};
	double c[2001]={0};
	cin>>n;
	while(n--)
	{
		cin>>index;
		cin>>a[index];
	}
	cin>>m;
	while(m--)
	{
		cin>>index;
		cin>>b[index];
	}
	for(int i=0;i<1001;i++)
	{
		for(int j=0;j<1001;j++)
			c[i+j]+=a[i]*b[j];
	}
	int count=0;
	for(int i=0;i<2001;i++)
	{
		if(c[i]!=0)
			count++;
	}
	cout<<count;
	for(int i=2000;i>=0;i--)
	{
		if(c[i]!=0)
			cout<<" "<<i<<" "<<setiosflags(ios::fixed)<<setprecision(1)<<c[i];
	}
}