本文共 2194 字，大约阅读时间需要 7 分钟。

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 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 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.22 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 
   
    #include 
    
   

Array Version:

#include 
   
    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
    
     =0;--i)	{		if(res[i]!=0)			printf(" %d %.1f",i,res[i]);	}	printf("\n");	return 0;}
    
   

转载地址：https://meteorrain.blog.csdn.net/article/details/86508227 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！