1002 A+B for Polynomials （25）

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

云无心鸟知还

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

阅读量110

点赞数

分类专栏： # 《算法笔记》

本文链接：https://blog.csdn.net/nishigesb123/article/details/83218741

版权

《算法笔记》专栏收录该内容

25 篇文章 0 订阅

订阅专栏

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

#include<cstdio>
int main()
{
	int K,ex,count=0;
	double co;
	double A[1001]={0};
	scanf("%d",&K);
	for(int i=0;i<K;i++) 
	{
		scanf("%d %lf",&ex,&co);
		A[ex]+=co;
		
	}
	scanf("%d",&K);
	for(int i=0;i<K;i++) 
	{
		scanf("%d %lf",&ex,&co);
		A[ex]+=co;	
	}
	for(int i=0;i<1001;i++)
	{
		if(A[i]!=0)count++;
	}
	printf("%d",count);
	for(int i=1000;i>=0;i--)
	{
		if(A[i]!=0)printf(" %d %.1f",i,A[i]);
	}
	return 0;
}