PAT学习日志(5)--A1002 A+B for Polynomials

这篇博客记录了作者在解决PAT(A1002)题目——多项式加法过程中遇到的问题及解决方案。首先,作者因初次代码中数组长度设置不当导致段错误,改正后部分测试点通过。接着,作者发现由于使用最大指数k作为循环条件,导致极端情况下的输出错误。最后,作者调整了输出方法,成功解决了所有问题。
摘要由CSDN通过智能技术生成

A1002 A+B for Polynomials

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​​  a​N​1 ​​  N​2​​  aN​2​​  ... N​K​​  aNK
​​ 
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≤NK<⋯<N​2<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

题目为基础题型,只需严格按照题目要求输入输出即可

初次代码

#include<cstdio>
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值