1009. Product of Polynomials (25)

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 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

题意：求2个多项式的乘积，数据量小，怎么水基本都可以过。

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;

struct Node{
	int exp;
	double coeff;
};

int main(){
	
	Node a[15],b[15];
	double ans[2005];
	for(int i=0; i<15; i++){
		a[i].coeff = b[i].coeff;
		a[i].exp = b[i].exp = 0;
	}
	memset(ans,0,sizeof(ans));
	
	int N,M;
	scanf("%d",&N);
	for(int i=1; i<=N; i++)
		scanf("%d %lf",&a[i].exp,&a[i].coeff);
	scanf("%d",&M);
	for(int i=1; i<=M; i++)
		scanf("%d %lf",&b[i].exp,&b[i].coeff);
		
	for(int i=1; i<=N; i++)
		for(int j=1;j<=M; j++){
			//cout << "---" << a[i].exp+b[j].exp << endl;
			ans[a[i].exp+b[j].exp] += a[i].coeff*b[j].coeff;
		}
			
	int count = 0;
	for(int i=2002; i>=0; i--)
		if( ans[i]!=0 )
			count++;
	printf("%d",count);
	for(int i=2002; i>=0; i--){
		if( ans[i]!=0 )
			printf(" %d %.1f",i,ans[i]);
	}
	printf("\n");
	return 0;
}