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 Input2 1 2.4 0 3.22 2 1.5 1 0.5Sample Output
3 2 1.5 1 2.9 0 3.2
#include <iostream>#include <math.h>using namespace std;double input[1001];int main() {int k, count, i, exp;double coef;while(cin>>k) {while(k–) {cin>>exp>>coef;input[exp] += coef;}cin>>k;while(k–) {cin>>exp>>coef;input[exp] +=coef;}count = 0;for(i=0 ; i<=1000; i++) {if(fabs(input[i]) > 1e-6) { //double类型不为零。count++;}}cout<<count;for(i=1000; i>=0; i–) {if(fabs(input[i]) > 1e-6) {printf(" %d %.1lf", i, input[i]); //C语言的输出格式比C++简单方便}}cout<<endl;}return 0;}
，每一件事都要用多方面的角度来看它
