1002. A+B for Polynomials (25) (浮点数判0)

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.2

2 2 1.5 1 0.5

Sample Output

3 2 1.5 1 2.9 0 3.2

这题翻译过来其实就是多项式加法

 #include<stdio.h>

 #include<stdlib.h>

 #include<math.h>

 int main()

 {

     int n;

     int i,j;

     double xi;

     int zi;

     double a[];

     int cnt=;

     for( i=;i<; i++)

     {

         a[i] = ;

     }

     for( i=; i<; i++){

         scanf("%d",&n);

         for( j=; j<n; j++){

             scanf("%d %lf",&zi,&xi);

             a[zi] += xi;

         }

     }

     for( i=; i>=; i--){

         if( fabs(a[i])>1e-)

              cnt++;

     }

     printf("%d",cnt);

     for( i=; i>=; i--){

         if( fabs(a[i])>1e-)

             printf(" %d %.1lf",i,a[i]);

     }

     return ;

 }

巴特西

1002. A+B for Polynomials (25) (浮点数判0)

最新文章

热门文章