1002 A+B for Polynomials （25 分)【模拟】

最新推荐文章于 2022-03-01 16:06:52 发布

胡小涛

最新推荐文章于 2022-03-01 16:06:52 发布

阅读量717

点赞数 3

分类专栏： PTA甲级文章标签：模拟多项式

本文链接：https://blog.csdn.net/lovecyr/article/details/89499563

版权

PTA甲级专栏收录该内容

71 篇文章 1 订阅

订阅专栏

1002 A+B for Polynomials （25 分)

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 sum of AAA and BBB 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.

Sample Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:
3 2 1.5 1 2.9 0 3.2

一上来，想用map存放多项式的系数和指数，代码如下：

#include<iostream>
#include<cstdio>
#include<map>
#include<functional>
using namespace std;

int main()
{
    map<int,double,greater<int> > poly;
for(int i = 0;i<2;i++)
{
int t;
        cin>>t;
for(int j = 0;j<t;j++)
{
int n;
double m;
            cin>>n>>m;
if(poly.find(n)==poly.end())
                poly[n] = m;
else
                poly[n]+=m;
}
}
    cout<<poly.size();
    map<int,double>::iterator it;
for(it = poly.begin();it!=poly.end();it++)
{
        cout<<" "<<it->first<<" ";
printf("%.1lf",it->second);
}
return 0;
}

然而最后四个测试样例报错，再仔细读题后发现，对于系数为0的数据不显示，因此修改后的代码如下：

#include<iostream>
#include<cstdio>
#include<map>
#include<functional>
using namespace std;


int main()
{
    map<int,double,greater<int> > poly;
    for(int i = 0;i<2;i++)
    {
        int t;
        cin>>t;
        for(int j = 0;j<t;j++)
        {
            int n;
            double m;
            cin>>n>>m;
            if(poly.find(n)==poly.end())
                poly[n] = m;
            else
                poly[n]+=m;
        }
    }
    int sum = poly.size();
    map<int,double>::iterator it;
    for(it = poly.begin();it!=poly.end();it++)
    {
        if(it->second==0)
            sum--;
    }
    cout<<sum;
    for(it = poly.begin();it!=poly.end();it++)
    {
        if(it->second!=0)
        {
            cout<<" "<<it->first<<" ";
            printf("%.1lf",it->second);
        }
    }
    return 0;
}