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

这个题的陷阱就是算最后不为0的项数总数放到最后算，可能相加后等于0，输出1位小数。

#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
    int n1,n2;
    while(~scanf("%d",&n1))
    {
        int i,a,max=0,sum=0;
        double ans[1010],b;
        memset(ans,0,sizeof(ans));
        for(i=1; i<=n1; i++)
        {
            scanf("%d%lf",&a,&b);
            ans[a]+=b;
        }
        scanf("%d",&n2);
        for(i=1; i<=n2; i++)
        {
            scanf("%d%lf",&a,&b);
            ans[a]+=b;
        }
        for(i=0;i<1002;i++)
            if(ans[i]!=0) 
                sum++;
        printf("%d",sum);
        for(i=1001; i>=0; i--)
        {
            if(ans[i]!=0)
            {
                printf(" %d %.1f",i,ans[i]);
            }
        }
        printf("\n");
    }
    return 0;
}