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 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
注意对相加后系数为0的处理。
代码
1 #include <stdio.h>
2
3 int main()
4 {
5 int k1,k2;
6 double d_arr1[],d_arr2[],d_arr3[];
7 int i_arr1[],i_arr2[],i_arr3[];
8 int i,j,k;
9 while(scanf("%d",&k1) != EOF){
for(i=;i<k1;++i)
scanf("%d%lf",&i_arr1[i],&d_arr1[i]);
scanf("%d",&k2);
for(i=;i<k2;++i)
scanf("%d%lf",&i_arr2[i],&d_arr2[i]);
i = ;
j = ;
k = ;
while(i < k1 && j < k2){
if (i_arr1[i] == i_arr2[j]){
i_arr3[k] = i_arr1[i];
d_arr3[k] = d_arr1[i++] + d_arr2[j++];
if (d_arr3[k] != 0.0)
++k;
}
else if (i_arr1[i] > i_arr2[j]){
i_arr3[k] = i_arr1[i];
d_arr3[k++] = d_arr1[i++];
}
else{
i_arr3[k] = i_arr2[j];
d_arr3[k++] = d_arr2[j++];
}
}
for (;i<k1;++i){
i_arr3[k] = i_arr1[i];
d_arr3[k++] = d_arr1[i];
}
for (;j<k2;++j){
i_arr3[k] = i_arr2[j];
d_arr3[k++] = d_arr2[j];
}
printf("%d",k);
for(i=;i<k;++i){
printf(" %d %.1f",i_arr3[i],d_arr3[i]);
}
printf("\n");
}
return ;
}