1002 A+B for Polynomials

最新推荐文章于 2021-02-26 11:53:21 发布

君骚兮

最新推荐文章于 2021-02-26 11:53:21 发布

阅读量192

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/yqajsj/article/details/99342291

版权

PAT甲级专栏收录该内容

5 篇文章 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(){
	float a[1001]={0};
	int k,ex;
	float co;
	scanf("%d",&k);
	for(int i=0;i<k;i++){
		scanf("%d%f",&ex,&co);
		a[ex]=co;
	}
	scanf("%d",&k);
	for(int i=0;i<k;i++){
		scanf("%d%f",&ex,&co);
		a[ex]+=co;
	}
	int count=0;
	for(int i=1000;i>=0;i--){
		if(a[i]!=0)count++;
	}
	printf("%d",count);
	for(int i=1000;i>=0;i--){
		if(count==0)break;
		if(a[i]!=0){
			printf(" %d %.1f",i,a[i]);
			count--;
		}
	}
}