1002. A+B for Polynomials (25)

1002. A+B for Polynomials (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

double c[1001];
int main()
{
	int K,N,maxN=0;
	double aN;
	cin>>K;
	while(K--){
		cin>>N>>aN;
		c[N]+=aN;
		if(N>maxN) maxN=N;
	}
	cin>>K;
	while(K--){
		cin>>N>>aN;
		c[N]+=aN;
		if(N>maxN) maxN=N;
	}
	int i,count=0;
	for(i=maxN;i>=0;i--){		
		if(c[i]!=0) count++;
	}
	cout<<count;
	for(i=maxN;i>=0;i--){
		if(c[i]!=0){
			cout<<" "<<i<<" "<<fixed<<setprecision(1)<<c[i];
		}
	}
	cout<<endl;
	return 0;
}