1009. Product of Polynomials (25)

最新推荐文章于 2021-09-07 21:09:21 发布

Uncle_Sugar

最新推荐文章于 2021-09-07 21:09:21 发布

阅读量384

点赞数

分类专栏： PAT甲级文章标签：多项式的表示数组运用

本文链接：https://blog.csdn.net/sinat_29278271/article/details/48137519

版权

PAT甲级专栏收录该内容

37 篇文章 1 订阅

订阅专栏

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

一道简单题，只要注意范围还有当系数为0的时候不输出就好了，数据范围2000，时间限制400ms,然后我就决定使用最蠢的方法。用一个double数组表示多项式，下标为幂指数，内容为系数。相乘的时候逐项相乘，比如第i项与第j项相乘,ans[i+j] += a[i]*b[j];简单愉快。最后扫一遍输出就好了。

# include <cstdio>
# include <cmath>

const int size = 2005;
const double eps = 1e-5; 

double ans[size];
double elem[2][size];

int main()
{
    int i,j,k,n;
    double an;
    for (i=0;i<size;i++)
        ans[i] = elem[0][i] = elem[1][i] = 0;
    for (i=0;i<2;i++)
      {
      	scanf("%d",&k);
      	while (k--)
          {
		    scanf("%d%lf",&n,&an);
		    elem[i][n] = an;
          }
	  }
	for (i=0;i<=1000;i++)
      for (j=0;j<=1000;j++)
	      ans[i+j] += elem[0][i]*elem[1][j];
    for (k=i=0;i<size;i++)
	      if (fabs(ans[i])>eps)
		      k++;
	printf("%d",k);
	for (i=size-1;i>-1;i--)
	    if (fabs(ans[i])>eps)
		    printf(" %d %.1lf",i,ans[i]);
	printf("\n");        
    return 0;
}