PAT-甲级-1002

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

【解析】
这道题就是求多项式系数相同的常数项相加，我们开个数组1000够用了，因为这道题总共说N1，N2都是小于1000的。比如样例中有1 2.4，和1 0.5那么我们就要把2.4和0.5相加
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
   double a[1001];
   int n,m,i,j,p,count=0;
   double q;
   memset(a,0,sizeof(a));
   scanf("%d",&n);
   for(i=0;i<n;i++)
   {
       scanf("%d%lf",&p,&q);
       a[p]+=q;
   }
   scanf("%d",&m);
   for(i=0;i<m;i++)
   {
       scanf("%d%lf",&p,&q);
       a[p]+=q;
   }
   for(i=1000;i>=0;i--)
   {
       if(a[i]!=0)
       count++;
   }
   printf("%d",count);
   for(i=1000;i>=0;i--)
   {
       if(a[i]!=0)
        printf(" %d %.1f",i,a[i]);
   }
    return 0;
}