1002 A+B for Polynomials (25 分)

最新推荐文章于 2024-11-02 09:55:19 发布

xingxing1016

最新推荐文章于 2024-11-02 09:55:19 发布

阅读量52

点赞数

分类专栏： PAT甲级题目

本文链接：https://blog.csdn.net/xingxing1016/article/details/118676626

版权

算法

PAT甲级题目专栏收录该内容

1 篇文章 0 订阅

订阅专栏

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 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.
**

Output Specification:**

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，使用memset函数。
代码

#include <bits/stdc++.h>
using namespace std;
int main()
{
	double p[1001];
	memset(p,0,sizeof(p));//将数组p全部初始化为0 
	int i,n,m,a,sum=0;
	double b;
	int count=0;//记录总数 
	cin>>n; 
	for(i=0;i<n;i++)
	{
		cin>>a>>b;
		// 指数相同时，系数相加
		p[a] += b;
	}
	cin>>m; 
	for(i=0;i<m;i++)
	{
		cin>>a>>b;
		// 指数相同时，系数相加
		p[a] += b;
	}
	for(i = 0;i < 1001;i++)
	{
		if(p[i]!=0)
		{
			count++;	
		}
	}
	cout<<count;
	for(i = 1000;i >= 0;i--)
	{
		if(p[i]!=0)
		{
			printf(" %d %.1f",i,p[i]);
		}
			
	}
	
}