PAT(Advanced) 1002. A+B for Polynomials (25)

(2018.3.7)

// 注意结果的系数为0时，这一项应去掉并不算个数

#include <iostream>
#include <cstdio>
#include <map>
using namespace std;


map<int, float> polynomials;
int main(){

    int num;
    int n;
    float a;
    for(int i = 0; i < 2; i++){
        cin >> num;
        while(num--){
            cin >> n >> a;
            polynomials[n] += a;
        }
    }

    map<int, float>::iterator it1, it2;
    map<int, float>::reverse_iterator rit;

    int cnt = 0;
    for(it1 = polynomials.begin(); it1 != polynomials.end();){
        if(it1->second == 0){
            it2 = it1;
            it1++;  // 注意先加后删
            polynomials.erase(it2);

            continue;
        }

        cnt++;
        it1++;
    }

    if(cnt == 0)
        cout << "0" << endl;
    else{
        cout << cnt;
        for(rit = polynomials.rbegin(); rit != polynomials.rend(); rit++){
            printf(" %d %.1f", rit->first, rit->second);
        }
        cout << endl;
    }

    return 0;
}

(2019.3.19)

题目大意：计算多项式A+B的和～

分析：设立c数组，长度为指数的最大值，c[i] = j表示指数i的系数为j，接收a和b输入的同时将对应指数的系数加入到c中，累计c中所有非零系数的个数，然后从后往前输出所有系数不为0的指数和系数～

#include <iostream>
using namespace std;

int main(){
    int k, n;
    float a;

    float num[1001] = {0};

    cin >> k;
    for(int i = 0; i < k; i++){
        cin >> n >> a;
        num[n] += a;
    }

    cin >> k;
    for(int i = 0; i < k; i++){
        cin >> n >> a;
        num[n] += a;
    }

    int cnt = 0;
    for(int i = 0; i < 1001; i++)
        if(num[i] != 0)
            cnt++;

    cout << cnt;
    for(int i = 1000; i >= 0; i--)
        if(num[i] != 0)
            printf(" %d %.1f", i, num[i]);

    cout << endl;


    return 0;
}