pat 甲1002. A+B for Polynomials（map）

最新推荐文章于 2024-01-28 22:42:58 发布

ninesun127

最新推荐文章于 2024-01-28 22:42:58 发布

阅读量268

点赞数 1

分类专栏： PAT 水题

本文链接：https://blog.csdn.net/qq_27601815/article/details/53178061

版权

PAT 同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

水题

54 篇文章 0 订阅

订阅专栏

1002. A+B for 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

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

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.

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

tip:思考问题还是不全面，一开始没有考虑到相加之后会化简掉某些项。

此问题使用map解决尤其的简单，注意反向迭代器输出

#include<iostream>
#include<map>
#include<iterator>
using namespace std;

map<int ,double>m;
void solve()
{
	int n;
	cin>>n;
	while(n--)
	{
		int x;double y;
		cin>>x>>y;
		m[x]+=y;
		if(m[x]==0)//如果系数为0，那么删除此数据项
			m.erase(x);
	} 
}

int main()
{
	solve();
	solve();
	
	cout<<m.size();
	for(auto it=m.rbegin();it!=m.rend();it++)
		printf(" %d %.1lf",it->first,it->second);
	
	return 0;
 }