1002. A+B for Polynomials (25)

最新推荐文章于 2024-01-28 22:42:58 发布

G______T

最新推荐文章于 2024-01-28 22:42:58 发布

阅读量154

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/G______T/article/details/78494002

版权

PAT 专栏收录该内容

96 篇文章 1 订阅

订阅专栏

题目：

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

Input

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

For each test case you should output the sum 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 to 1 decimal place.

Sample Input

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output

3 2 1.5 1 2.9 0 3.2

题解：

由于0<=N<=1000，范围较小，把多项式直接用数组存储即可。

代码：

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
	double sum[1010];
	memset(sum, 0, 1010 * sizeof(double));
	
	int k1, k2, ex;
	double coe;
	scanf("%d", &k1);
	for(int i = 0; i < k1; i++)
	{
		scanf("%d%lf", &ex, &coe);
		sum[ex] += coe;
	}
	scanf("%d", &k2);
	for(int i = 0; i < k2; i++)
	{
		scanf("%d%lf", &ex, &coe);
		sum[ex] += coe;
	}
	
	int cnt = 0;
	for(int i = 0; i < 1001; i++)
	{
		if(sum[i] != 0)
			cnt++;
	}
	printf("%d", cnt);
	for(int i = 1000; i >= 0; i--)
	{
		if(sum[i] != 0)
		{
			printf(" %d %.1lf", i, sum[i]);
		}
	}
	return 0;
}