PAT (Advanced Level) Practice 1009 Product of Polynomials（25分）【模拟】

最新推荐文章于 2022-02-20 17:57:10 发布

我成为一只小羊

最新推荐文章于 2022-02-20 17:57:10 发布

阅读量148

点赞数

本文链接：https://blog.csdn.net/Exupery_/article/details/100577678

版权

This time, you are supposed to find $A \times 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 N_1 a_{N_1} N_2 a_{N_2} ... N_K a_{N_K}$
where $K$ is the number of nonzero terms in the polynomial, $N_i$ and $a_{N_i} (i=1,2,⋯,K)$ are the exponents and coefficients, respectively. It is given that $1≤K≤10, 0≤N_K<⋯<N_2<N_1≤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

题意

求多项式A*B。

思路

先读入第一个多项式，在读入第二个时，计算当前项与第一个多项式的每一项相乘的结果，累加起来就是最后的答案。

代码

#include <cstdio>
#include <cmath>

using namespace std;

const int SIZE = 2005;
const double EPS = 1e-8;
double arr[SIZE], res[SIZE];

int main() {
    for (int i = 0; i < 2; ++i) {
        int n;
        scanf("%d", &n);
        for (int j = 0; j < n; ++j) {
            int exp;
            double cof;
            scanf("%d %lf", &exp, &cof);

            if (i == 0) arr[exp] = cof;
            else
                for (int k = 0; k <= 1000; ++k)
                    res[k + exp] += cof * arr[k];
        }
    }

    int cnt = 0;
    for (int i = 0; i < SIZE; ++i)
        if (fabs(res[i]) > EPS) ++cnt;
    printf("%d", cnt);

    if (cnt)
        for (int i = SIZE - 1; i >= 0; --i)
            if (fabs(res[i]) > EPS) printf(" %d %.1f", i, res[i]);
}