PAT_A1002 A+B for Polynomials

PAT 专栏收录该内容
5 篇文章 0 订阅

PAT学习笔记之A1002 A+B for Polynomials (25 分)

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​ 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 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

思路:

两个多项式的和相加,根据幂次自大到小输出各项系数。
注意,1000次幂是可以取到的,s数组大小至少为1001,不能为1000。

完整代码:

#include <iostream>
using namespace std;

int main() {
    double s[1001]={},d;
    int i,j,k,n,sum=0;
    for(i=0;i<2;i++){
        if(scanf("%d",&k)){};
        for(j=0;j<k;j++){
            if(scanf("%d%lf",&n,&d)){};
            s[n]+=d;
        }
    }
    for(i=0;i<1001;i++){
        if(s[i]!=0){
            sum++;
        }
    }
    printf("%d",sum);
    for(i=1000;i>=0;i--){
        if(s[i]!=0){
            printf(" %d %.1f",i,s[i]);
        }
    }
    return 0;
}
  • 0
    点赞
  • 0
    评论
  • 0
    收藏
  • 一键三连
    一键三连
  • 扫一扫,分享海报

©️2021 CSDN 皮肤主题: 数字20 设计师:CSDN官方博客 返回首页
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值