PAT 甲级 1002 A+B for Polynomials_1002 a+b for polynomials-CSDN博客

本文介绍了一道PAT算法题目，要求实现两个多项式的相加操作。使用STL Map或HashTable解决，讨论了两种数据结构的特点及适用场景。提供了Map版和Array版的代码实现。

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

1002 A+B for Polynomials （25 point(s)）

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

Experiential Summing-up

emmmmm Just easy. Either STL Map or Hash Table can be used. The character of STL Map is less memory and slower speed. But Hash Table is exact opposited, that is larger memory and quicker speed. You can use ether one according to question's requirements. Don't forget can not output the one whose coefficient is zero. That's all~(*•̀ㅂ•́)و

(The purpose of using English to portray my solution is that to exercise the ability of my expression of English and accommodate PAT advanced level's style.We can make progress together by reading and comprehending it. Please forgive my basic grammar's and word's error. Of course, I would appreciated it if you can point out my grammar's and word's error in comment section.( •̀∀•́ ) Furthermore, Big Lao please don't laugh at me because I just a English beginner settle for CET6 _(:з」∠)_ )

Accepted Code

Map Version:

#include <cstdio>
#include <map>
using namespace std;

int main()
{
	int m,n,k,temp;
	double t;
	map<int,double> mp;
	scanf("%d",&m);
	for(int i=0;i<m;++i)
	{
		scanf("%d %lf",&temp,&t);
		mp[temp]=t;
	}
	scanf("%d",&m);
	for(int i=0;i<m;++i)
	{
		scanf("%d %lf",&temp,&t);
		if(mp.count(temp)==0)
		{
			mp[temp]=t;
		}
		else
		{
			mp[temp]+=t;
			if(mp[temp]==0)
				mp.erase(temp);
		}
	}
	printf("%d",mp.size());
	for(map<int,double>::reverse_iterator it=mp.rbegin();it!=mp.rend();++it)
	{
		printf(" %d %.1f",it->first,it->second);
	}
	printf("\n");
	return 0;
}

Array Version:

#include <cstdio>
const int maxn=1010;
double res[maxn]={0};
bool flag[maxn]={0};
int main()
{
	int a,b,k;
	double t;
	scanf("%d",&a);
	int num=0;
	for(int i=0;i<a;++i)
	{
		scanf("%d %lf",&k,&t);
		res[k]+=t;
		if(flag[k]==0)
		{
			++num;
			flag[k]=1;
		}
	}
	scanf("%d",&b);
	for(int i=0;i<b;++i)
	{
		scanf("%d %lf",&k,&t);
		res[k]+=t;
		if(flag[k]==0)
		{
			++num;
			flag[k]=1;
		}
		if(res[k]==0)
			--num;
	}
	printf("%d",num);
	for(int i=maxn-1;i>=0;--i)
	{
		if(res[i]!=0)
			printf(" %d %.1f",i,res[i]);
	}
	printf("\n");
	return 0;
}