This time, you are supposed to find A*B where A and B are two polynomials.

Input Specification:

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 Specification:

For each test case you should output the product 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 up to 1 decimal place.

Sample Input

2 1 2.4 0 3.2 
2 2 1.5 1 0.5 

Sample Output

3 3 3.6 2 6.0 1 1.6 
代码

 1 #include <stdio.h>

 2 #include <algorithm>

 3 using namespace std;

 4 

 5 

 6 typedef struct Poly{

 7     int exp;

 8     double coef;

 9 }Poly;

 int comp(const Poly&,const Poly&);

 int main()

 {

     int KA,KB;

     Poly A[],B[],C[];

     int i,j;

     while(scanf("%d",&KA) != EOF){

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

             scanf("%d%lf",&A[i].exp,&A[i].coef);

         }

         scanf("%d",&KB);

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

             scanf("%d%lf",&B[i].exp,&B[i].coef);

         }

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

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

                 C[i * KB + j].exp = A[i].exp + B[j].exp;

                 C[i * KB + j].coef = A[i].coef * B[j].coef;

             }

         sort(C,C+KA*KB,comp);

         double coef_sum = C[].coef;

         int exp = C[].exp;

         j = ;

         for(i=;i<KA*KB;++i){

             if(exp == C[i].exp){

                 coef_sum += C[i].coef;

             }

             else{

                 if (abs(coef_sum) > 0.000001){

                     C[j].exp = exp;

                     C[j++].coef = coef_sum;

                 }

                 exp = C[i].exp;

                 coef_sum = C[i].coef;

             }

         }

         if (abs(coef_sum) > 0.000001){

             C[j].exp = exp;

             C[j++].coef = coef_sum;

         }

         printf("%d",j);

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

             printf(" %d %.1lf",C[i].exp,C[i].coef);

         }

         printf("\n");

     }

     return ;

 }

 int comp(const Poly &x,const Poly &y)

 {

     return y.exp < x.exp;

 }