PAT A1002. A+B for Polynomials (25)

最新推荐文章于 2022-08-10 19:42:18 发布

jolivan

最新推荐文章于 2022-08-10 19:42:18 发布

阅读量206

点赞数

分类专栏： PAT 文章标签：输出格式

本文链接：https://blog.csdn.net/jolivan/article/details/54849452

版权

PAT 专栏收录该内容

125 篇文章 0 订阅

订阅专栏

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

#include <cstdio>
#include <algorithm>
#define Max 1234
using namespace std;
int main()
{
	double f,c[Max]={};
	
	int n,m,k=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d %lf",&m,&f);
		c[m]+=f;	
	}
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d %lf",&m,&f);
		c[m]+=f;	
	}
	
    for(int i=0;i<Max;i++)
	{
		if(c[i]!=0.0)
			k++;
	}
    
        printf("%d",k);
		for(int i=Max-1 ;i>=0;i--)
		{
			if(c[i]!=0.0)
			{
				printf(" %d %.1f",i,c[i]);

			}
		}
	system("pause");
	return 0;
}