1002. A+B for Polynomials (25)

1002. A+B for Polynomials (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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<cstdio>
#include<cstring>
using namespace std;
int main()
{
    double arr[1001];
    memset(arr,0,sizeof(arr));
    /*index:为数组下标，表示多项式的指数。 */
    int k1,k2,index,n,i;
    double coefficient;//系数，对应于数组中的值
    cin>>k1;
    n = k1;
    while(k1--)
    {
        cin>>index>>coefficient;
        arr[index]=coefficient;
    }
    cin>>k2;
    while(k2--)
    {
        cin>>index>>coefficient;
        if(arr[index]==0)
        {
            n++;
        }
        arr[index] = arr[index]+coefficient;
        if(arr[index]==0)
        {
            n--;
        }
    }
    cout<<n;
    for(index=1000;index>=0;index--)
    {
        if(arr[index]!=0)
        {
            printf(" %d %.1lf",index,arr[index]);
        }
    }


}