1002. A+B for Polynomials (25)

memset的头文件是<string.h>

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.22 2 1.5 1 0.5

Sample Output

3 2 1.5 1 2.9 0 3.2

#include<iostream>#include<string.h>#include<iomanip>using namespace std;int main(){int k1, k2, n;float arry[1001], an;memset(arry, 0, sizeof(arry));cin >> k1;int count = 0, maxn = 0;for (int i = 0; i < k1; i++){cin >> n >> an;maxn = maxn > n ? maxn : n;arry[n] = an;}cin >> k2;for (int i = 0; i < k2; i++){cin >> n >> an;maxn = maxn > n ? maxn : n; arry[n] += an;}for (int i = maxn; i >= 0; i--)if (arry[i] != 0) count++;cout << count;for (int i = maxn; i >= 0; i--) {if (arry[i] != 0)cout << " " << i << " " << setiosflags(ios::fixed) << setprecision(1) << arry[i];}return 0;}