1009 Product of Polynomials (25分)

最新推荐文章于 2024-10-16 00:00:43 发布

gwang1_1

最新推荐文章于 2024-10-16 00:00:43 发布

阅读量53

点赞数

文章标签：算法 c++

本文链接：https://blog.csdn.net/qq_38303166/article/details/108631756

版权

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 $N_1 a_{N_1}$ $N_2 a_{N_2}$ … $N_K a_{N_K}$
where K is the number of nonzero terms in the polynomial, $N_i$ and $a_{N_i}$ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10, 0≤ $N_K$ …< $N_2$ < $N_1$ ≤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>
using namespace std;

float a[1001]{0};
float b[1001]{0};
float c[2001]{0}; 

int main(){
	int k,exp,num=0;
	float cof;
	scanf("%d",&k);
	for(int i=0;i<k;i++){
		scanf("%d%f",&exp,&cof);
		a[exp]=cof;
	}
	scanf("%d",&k);
	for(int i=0;i<k;i++){
		scanf("%d%f",&exp,&cof);
		b[exp]=cof;
	}
	for(int i=0;i<1001;i++){
		for(int j=0;j<1001;j++){
			if(a[i]!=0 && b[j]!=0)
				c[i+j]+=a[i]*b[j];
		}
	}
	for(int i=0;i<2001;i++)
		if(c[i]!=0)
			num++;	
	printf("%d",num);
	if(num){
		for(int i=2000;i>=0;i--){
			if(c[i]!=0)
				printf(" %d %.1f",i,c[i]);
		}
	}
	return 0;
}