Product of Polynomials (25)

题目描述

This time, you are supposed to find A*B where A and B are two polynomials.

输入描述:

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.

输出描述:

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.

输入例子:

2 1 2.4 0 3.2
2 2 1.5 1 0.5

输出例子:

3 3 3.6 2 6.0 1 1.6

#include<stdio.h>

double a[1005],b[1005][2],at[2001];
int main(){
	int n,i,j,count=0,x;
	double y;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d %lf",&x,&y);
		a[x]+=y;
	}
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%lf %lf",&b[i][0],&b[i][1]);
//		printf("%f %f\n",b[i][0],b[i][1]);
	}
	for(i=0;i<1005;i++){
		if(a[i]!=0){
			for(j=0;j<n;j++){
				at[i+(int)b[j][0]]+=a[i]*b[j][1];
			}
		}
	}
	for(i=0;i<=2000;i++){
		if(at[i]!=0)
			count++;
	}
	printf("%d",count);
	for(i=2000;i>=0;i--){
		if(at[i]!=0)
			printf(" %d %.1lf",i,at[i]);
	}
}

注意点

小数部分一定要用double定义