1002. A+B for Polynomials (25)

This time, you are supposed to find A+B where A and B are two polynomials.

Input

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 a_N1 N2 a_N2... NK a_NK, where K is the number of nonzero terms in the polynomial, Ni and a_Ni (i=1, 2, ..., K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10，0 <= NK < ... < N2 < N1 <=1000.

Output

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

---

多项式系数处理,比天梯赛初赛要简单许多.

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>

#define maxn 1010
const int INF = 0x3ffffff;
double res[1010];
int cnt;
using namespace std;

int Get_count(){
    int temp=0;
    for(int i=0;i<=cnt;i++){
        if(res[i]){
            temp++;
        }
    }
    return temp;
}


void traverse(){
    int flag=0;
    printf("%d",Get_count());
    for(int i=cnt;i>=0;i--){
        //if(flag++) printf(" ");
        if(res[i]){
            printf(" %d %.1f",i,res[i]);
        }
    }
}


void input(){
    int n,index;
    double val;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>index>>val;
        cnt=max(cnt,index);
        res[index]+=val;
    }
}

int main(){
    cnt=-INF;
    memset(res,0,sizeof(res));
    for(int j=0;j<2;j++)
        input();
    traverse();
    return 0;
}