1009. Product of Polynomials (25)

最新推荐文章于 2020-04-05 19:30:58 发布

SDUTyangkun

最新推荐文章于 2020-04-05 19:30:58 发布

阅读量255

点赞数

分类专栏： pat甲级练习

本文链接：https://blog.csdn.net/SDUTyangkun/article/details/77937373

版权

pat甲级练习专栏收录该内容

30 篇文章 0 订阅

订阅专栏

1009. Product of Polynomials (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
   int n, m;
   double exp[1101];
   double exp1[2101];
   int  tmpe[2101];
   memset(exp, 0, sizeof(exp));
   memset(exp1, 0, sizeof(exp1));
   scanf("%d", &n);
   int index;
   for( int i =0; i < n; i++)
   {
      scanf("%d", &index);
      tmpe[i] = index;
      scanf("%lf", &exp[index]);
   }

   scanf("%d", &m);
   double tmp;
   for(int i = 0; i < m; i++)
   {
       scanf("%d%lf", &index, &tmp);
       for(int j = 0; j < n; j++)
       {
          exp1[tmpe[j] + index] += exp[tmpe[j]]*tmp;
       }
   }
   int cnt = 0;
   for(int i = 2100; i>= 0; i--)
   {
       if(exp1[i] != 0)
        cnt++;
   }
   printf("%d",cnt);
   for(int i = 2100; i >= 0; i--)
   {
            if(exp1[i] != 0)
                printf(" %d %.1f", i, exp1[i]);
   }
}