PAT (Advanced Level) Practice 1002 A+B for Polynomials

最新推荐文章于 2024-07-15 15:17:48 发布

momoiscoding

最新推荐文章于 2024-07-15 15:17:48 发布

阅读量106

点赞数

分类专栏： PAT (Advanced Level) Practice 文章标签： c++ 算法蓝桥杯

本文链接：https://blog.csdn.net/m0_59702288/article/details/125608540

版权

PAT (Advanced Level) Practice 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

1002 A+B for Polynomials

摘要由CSDN通过智能技术生成

题目标题

1002 A+B for Polynomials

题目描述

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

输入描述

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.

输出描述

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

输入样例

2 1 2.4 0 3.2
2 2 1.5 1 0.5

输出样例

3 2 1.5 1 2.9 0 3.2

思路描述

多项式相加，最后输出不同的幂数以及对应的系数（系数不能为0）。

所以用double数组创造由整数幂数到double系数的一个映射。

Code

#include<iostream>
using namespace std;
const int N=1010;
double s[N];
int main()
{
    int n1,n2,count=0;
    cin>>n1;
    for(int i=0;i<n1;i++)
    {
        int n;
        double a;
        scanf("%d %lf",&n,&a);//n是幂数 a是系数
        s[n]+=a;
    }
    cin>>n2;
    for(int i=0;i<n2;i++)
    {
        int n;
        double a;
        scanf("%d %lf",&n,&a);
        s[n]+=a;
    }
    for(int i=1000;i>=0;i--)
    {
        if(s[i]!=0)
            count++;
    }
    cout<<count;
    for(int i=1000;i>=0;i--)
        if(s[i]!=0)
            printf(" %d %.1lf",i,s[i]);
    return 0;
}