PAT_A1002 A+B for Polynomials

最新推荐文章于 2024-09-22 11:42:19 发布

zy_Cherry

最新推荐文章于 2024-09-22 11:42:19 发布

阅读量92

点赞数

分类专栏： PAT 文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/m0_45024507/article/details/119572513

版权

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 N₁ a_N1 N₂ a_N2 … N_K a_NK

where K is the number of nonzero terms in the polynomial, N_i and a_Ni (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N_K <⋯<N₂ <N₁≤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;
}