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
#include "stdio.h"
#define MAX 1010
int main(){
int n,m;
float z;
while(scanf("%d",&n)!=EOF){
float t[MAX]={0}; //定义float类型数组,用于存放不同指数下的系数和,数字下标即代表指数
for(int i=0;i<n;i++){
scanf("%d%f",&m,&z);
t[m]+=z;
}
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%f",&m,&z);
t[m]+=z;
}
n=0;
//计算多项式有几项
for(int i=0;i<MAX;i++){
if(t[i]!=0) n++;
}
printf("%d",n);
for(int i=MAX-1;i>=0;i--){
if(t[i]!=0) printf(" %d %.1f",i,t[i]);
}
printf("\n");
}
}