PAT-A1002题解

最新推荐文章于 2020-04-11 17:20:43 发布

悟空在游泳

最新推荐文章于 2020-04-11 17:20:43 发布

阅读量833

点赞数

分类专栏：算法入门 PAT题解目录文章标签： PAT

本文链接：https://blog.csdn.net/geek_jerome/article/details/79427979

版权

博客介绍了PAT-A1002题目的解题思路，该题目要求求解两个包含最多10个非零项、指数不超过1000的多项式的和。样本输入和输出展示了多项式相加的形式。博主提供了准确到1位小数的AC（Accepted）代码，并邀请读者访问其个人博客查看完整内容。

摘要由CSDN通过智能技术生成

PAT-A1002. 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 Ou