1009. Product of Polynomials (25)

最新推荐文章于 2024-03-04 18:04:28 发布

原创最新推荐文章于 2024-03-04 18:04:28 发布 · 282 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #PAT #Product of Polynomia

PAT(Advanced Level) 专栏收录该内容

103 篇文章

订阅专栏

本文详细阐述了如何通过输入两个多项式的系数和指数来计算它们的乘积，并提供了具体的C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

using namespace std;

#define MAX_EXP 1005

int main(){
	int m, n;

	scanf("%d", &m);
	float coef1[m];
	int exp1[m];

	for(int i = 0; i < m; ++i){
		scanf("%d%f", exp1 + i, coef1 + i);
	}

	scanf("%d", &n);
	float coef2[n];
	int exp2[n];

	for(int i = 0; i < n; ++i){
		scanf("%d%f", exp2 + i, coef2 + i);
	}

	int maxexp = exp1[0] + exp2[0];
	float coef[maxexp + 1];
	fill_n(coef, maxexp + 1, 0.0);

	for(int i = 0; i < m; ++i){
		for(int j = 0; j < n; ++j){
			coef[exp1[i] + exp2[j]] += coef1[i] * coef2[j];
		}
	}

	int sum = 0;
	for(int i = 0; i < maxexp + 1; ++i){
		if(coef[i]) ++sum;
	}

	printf("%d", sum);

	for(int i = maxexp; i >= 0; --i){
		if(coef[i]) printf(" %d %.1f", i, coef[i]);
	}


	return 0;
}