1002 A+B for Polynomials （25 分）

1002 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​_N​1​​ N_​2​​ a_N​2​​ … N_K​​ a_​Nk

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≤N_​K​​ <⋯<N_​2​​ <N_​1​​ ≤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

分析：

用数组的索引表示指数，用数组的值表示这个指数项的系数。
C++代码

#include<iostream>
using namespace std;
const int N=1010;
double c[N];
int main() {
    int ne,nc,a;
    double b;
    cin>>ne;
    for(int i=0; i<ne; i++) {
        cin>>a>>b;
        c[a]=b;
    }
    cin>>nc;
    for(int i=0; i<nc; i++) {
        cin>>a>>b;
        c[a]+=b;
    }
    int cnt=0;
    for(int i=0; i<N; i++) {
        if(c[i]) cnt++;
    }
    cout<<cnt;
    for(int i=N; i>=0; i--) {
        if(c[i]) printf(" %d %.1lf",i,c[i]);
    }
    return 0;
}

C代码

#include<stdio.h>
#include <math.h>
#define N 1010
double c[N];
int main() {
    int ne,nc,a,i,cnt=0;
    double b;
    scanf("%d",&ne);
    for(i=0; i<ne; i++) {
        scanf("%d %lf",&a,&b);
        c[a]=b;
    }
    scanf("%d",&nc);
    for(i=0; i<nc; i++) {
        scanf("%d %lf",&a,&b);
        c[a]+=b;
    }
    for(i=0; i<N; i++) {
        if(c[i]) cnt++;
    }
    printf("%d",cnt);
    for(i=N; i>=0; i--) {
        if(fabs(c[i]-0.0)>0.000001) printf(" %d %.1lf",i,c[i]);
    }
    return 0;
}