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

此题本应该是当做单链表的多项式相加的算法来做，此处做了简化，用double数组来储存，因为多项式的指数最多为1000.下标为指数，值为系数，倒序输出即可。

值得注意的是，在判断系数是否为0时，要做两边判断，一开始错在只判断了p[i] -0 <0.00001，也要判断 p[i] -0 >-0.00001 这才是0；

代码：

#include <iostream>
#include <stdio.h>
using namespace std;


int main()
{
    double p[1001]={0};


    int n ,exp,i;
    double coef;


    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>exp>>coef;
        p[exp] += coef;
    }


    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>exp>>coef;
        p[exp] += coef;
    }


    int count=0;
    for(i=1000;i>=0;i--)
    {
        if(p[i]-0 >0.00001 || p[i]-0 <-0.00001)
            count++;
    }


    cout<<count;
    int size=0;
    for(i=1000;i>=0;i--)
    {
        if(p[i]-0 >0.00001 || p[i]-0 <-0.00001)
        {
            printf(" %d %.1f",i,p[i]);
            size++;
        }
        if(size == count)
            break;
    }


    return 0;
}