PAT (Advanced Level) 甲级 1009 Product of Polynomials

最新推荐文章于 2024-11-12 12:29:51 发布

雨中纸鸢943

最新推荐文章于 2024-11-12 12:29:51 发布

阅读量227

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/qq_61793850/article/details/132305967

版权

点此查看所有题目集

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 aN1 N2 aN2 ... NK aNK

where K is the number of nonzero terms in the polynomial, Ni and aNi (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.

计算两个多项式相乘后的结果

#include <bits/stdc++.h>
using namespace std;

double ans[2002];
double res[2002];
int main()
{
    int K1;
    cin >> K1;
    for (int i = 0;i<K1;i++)
    {
        int a;
        double b;
        cin>> a >> b;
        ans[a] = b;
    }
    int K2;
    cin >> K2;
    for (int i = 0;i<K2;i++)
    {
        int a;
        double b;
        cin>> a >> b;
        for(int j = 0;j<2002;j++)
        {
            if (ans[j])
            {
                res[j+a] += ans[j]*b;
            }
        }
     }
    int t = 0;
    //这样的计数可以避免中途出现0而计入的错误
    for(int i = 2002;i>=0;i--)
    {
        if (res[i]) t++;
    }
    cout << t;
    for(int i = 2002;i>=0;i--)
    {
        
        if (res[i]) printf(" %d %.1lf",i,res[i]);
    }
    return 0;
}