PAT练习笔记——1002. A+B for Polynomials (25)

qkk

题目
1002. A+B for Polynomials (25)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 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

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

思路
根据题目要求，让我们计算两个多项式A与B的值，输入两行分别为A与B，
每行有 K N1 aN1 N2 aN2 ... NK aNK，K表示一共有K项非零项，NK表示第k次方，aNK表示第K次方前的系数。
题目比较简单，只要使用一个1001大小的double型数组就可以解决A+B的问题。
格式化输出，可以遍历数组统计非零元素个数count，然后再次输出Nk和aNk时先输出一个空格，count--即可。
代码如下：

游客，如果您要查看本帖隐藏内容请回复

小甲鱼

代码请使用代码专用格式（<>）包裹起来哦~

qkk

小甲鱼 发表于 2017-7-12 15:11
代码请使用代码专用格式（）包裹起来哦~

惊现小甲鱼