1002 A+B for Polynomials (25 分)

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

感觉自己就是个bug

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

阅读量92

点赞数

分类专栏： pat甲级

本文链接：https://blog.csdn.net/shshbdhsjjd/article/details/114691071

版权

pat甲级专栏收录该内容

181 篇文章 1 订阅

订阅专栏

1002 A+B for Polynomials (25 分)

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<iostream>
using namespace std;


int main(){
	double a[1001]={0},b[1001]={0};
	int K,expon,num=0;
	double coef;
	for(int i=0;i<2;i++){
		cin>>K;
		for(int j=0;j<K;j++){
			cin>>expon>>coef;
			a[expon]+=coef;
		}
	}
	for(int i=1000;i>=0;i--){
		if(a[i]!=0)num++;
	}
	printf("%d",num);
	for(int i=1000;i>=0;i--){
		if(a[i]!=0)printf(" %d %.1lf",i,a[i]);
	}	
}