PAT A1009 Product of Polynomials (25分)

PAT A1009 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 N​2​​ a​N​2​​ ​ … NK​ a​N​K where K is the number of nonzero terms in the polynomial, Ni​​ and aN​i​​ ​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10, 0≤N​K​​ <⋯<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

以下是AC的代码：

#include<cstdio>
#define maxn 1000100
double pa[maxn],pb[maxn];
int main(void){
	for(int i=0;i<maxn;i++){
		pb[i]=pa[i]=0;}
	int total,te;
	double tc;
	int count =0;
	scanf("%d",&total);
	for(int i=0;i<total;i++){
		scanf("%d%lf",&te,&tc);
		pa[te]=tc;
	}
	scanf("%d",&total);
	for(int i=0;i<total;i++){
		scanf("%d%lf",&te,&tc);
		for(int j=0;j<maxn;j++){
			double tmp=pa[j]*tc;
			pb[j+te]+=tmp;
		}
	}
	for(int i=0;i<maxn;i++){
		if(pb[i]!=0)count++;
	}
	printf("%d",count);
	for(int i=maxn-1;i>=0;i--){
		if(pb[i]!=0)printf(" %d %.1f",i,pb[i]);
	}
	return 0;
}

思路：
与A1002，B1010相似，使用一个数组记录待乘的A数组，一边读第二个数组一边将结果加入答案数组中。这里我自己做的时候很明显，为什么把maxn设置到1 000 100这个数量级，是因为我想错了，以为1000幂次相乘会变成1 000 000. 虽然不影响程序AC，如果换一个时间要求，可能就过不了了。