# 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 aN1 N2 aN2 ... NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (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

#### 注意点：

（1）如果两个多项式相加后没有系数非0的项，应该只输出“0”，后面不能跟空格

（2）两个多项式中某一项相加系数是0了，就不能输出这一项，前面K计数时，也不能把这一项算进去。

#### C++代码：

#include<bits/stdc++.h>
using namespace std;
double coefficient[1005]={0};
int main(){
int K;
scanf("%d",&K);
while(K--){
int a;
double b;
scanf("%d%lf",&a,&b);
coefficient[a]+=b;
}
scanf("%d",&K);
while(K--){
int a;
double b;
scanf("%d%lf",&a,&b);
coefficient[a]+=b;
}
int size=0;
for(int i=0;i<1005;++i)
if(coefficient[i]!=0)
++size;
printf("%d",size);
for(int i=1005;i>=0;--i)
if(coefficient[i]!=0)
printf(" %d %.1f",i,coefficient[i]);
return 0;
}

• 擅长领域：
• 算法