1002. A+B for Polynomials

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 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

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 
#include 
#include 
using namespace std;
int main()
{
	int n, N, cnt = 0;
	double aN = 0.0f;
	mapp;
	for (int i = 1; i <= 2; i++) {
		scanf("%d", &n);
		for (int j = 1; j <= n; j++) {
			scanf("%d%lf", &N, &aN);
			p[N] += aN; 
		}
	}
	for(auto a = p.begin(); a!= p.end(); a++) {
		if(a->second != 0.0 && a->second != -0.0)
			cnt++;
	}
	printf("%d", cnt);
	for (auto a = p.rbegin(); a != p.rend(); a++) {
		if(a->second != 0.0 && a->second != -0.0)
			printf(" %d %.1lf", a->first, a->second); 
	}
 	return 0;
}



你可能感兴趣的:(模拟,哈希表(Hash))