1002 A+B for Polynomials

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

.无名之辈

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

阅读量145

点赞数

分类专栏：算法文章标签： pat

本文链接：https://blog.csdn.net/qq_38938670/article/details/88358593

版权

算法专栏收录该内容

31 篇文章 1 订阅

订阅专栏

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 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

accept code:

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

int main()
{
	map<int,double> mp1;//存储第一行数据
	map<int,double> mp2;//存储第二行数据
	map<int,double> mp3;//存储两行数据相加之后的结果
	int k1,k2,a,b;
	cin>>k1;
	int max=-1;
	while(k1--){//输入第一组数据
		cin>>a;
		cin>>mp1[a];
		if(a>max)
		{
			max=a;
		} 
	}
	cin>>k2;
	while(k2--){//输入第二组数据
		cin>>b;
		cin>>mp2[b];
		if(b>max)//找出两组数据中键最大的值
		{
			max=b;
		} 
	}
	
	int count=0;
	for(int i=0;i<=max;i++){//将两组数据相加
		mp3[i]=mp1[i]+mp2[i];

		if(mp3[i]!=0)
			count++;
	}
	cout<<count;
	for(int j=max;j>=0;j--){//从后往前输出，map是自动从小到大排序的
		if(mp3[j]!=0)//值对应结果为0的话就不做处理
		{
//			cout<<" "<<j<<" "<<setprecision(2)<<mp3[j];//用这个函数会出现格式错误，默认格式
                                                       //是科学计数法的格式，还是用printf吧
			printf(" %d %.1f",j,mp3[j]);
		}
	}
	return 0;	
	
}