1002 A+B for Polynomials

三块不一样的石头

已于 2022-10-05 18:59:40 修改

阅读量100

点赞数

于 2022-08-15 14:53:38 首次发布

本文链接：https://blog.csdn.net/daybreak_alonely/article/details/126346782

版权

PAT (Advanced Level) Practice 专栏收录该内容

59 篇文章 1 订阅

订阅专栏

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

题⽬⼤意

计算多项式A+B的和(输入前者指数后者系数)

思路 : 设double数组key，key[指数] = 系数

C/C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
    double key[1002]={0},n;
    long long k,a;
    for(int z=0;z<2;z++){
        cin >> k;
        while (k--){
            cin >> a >> n;
            key[a] += n;
        }
    }

    int flag=0;
    for(int z=0;z<=1001;z++) if(key[z]!=0) flag++;
    cout << flag;

    for(int z=1001;z>=0;z--){
        if(key[z]!=0) {
            printf(" %d %.1f",z,key[z]);
        }
    }

    return 0;
}