PAT 1002 A+B for Polynomials

最新推荐文章于 2022-08-10 19:42:18 发布

AI算法攻城狮

最新推荐文章于 2022-08-10 19:42:18 发布

阅读量2k

点赞数 1

分类专栏：一线互联网面试攻略

本文链接：https://blog.csdn.net/jxq0816/article/details/50631758

版权

一线互联网面试攻略专栏收录该内容

30 篇文章 231 订阅 ¥99.90 ¥299.90

订阅专栏

该博客主要介绍了PAT 1002题目的详细内容，这是一个关于求解两个多项式A和B之和的问题。输入包含两行，每行分别表示一个多项式，包含非零项数K及每个项的指数和系数。输出要求按照输入格式给出A和B的和，精确到小数点后一位。文章可能还包含了实现代码。

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

一、题目描述

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

了解本专栏