pta-advanced level -002

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 N​1​​ a​N​1​​​​ N​2​​ a​N​2​​​​ ... N​K​​ a​N​K​​​​

where K is the number of nonzero terms in the polynomial, N​i​​ and a​N​i​​​​ (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤N​K​​<⋯<N​2​​<N​1​​≤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>
#include<cstring>
using namespace std;
#define maxn 1005
double a[maxn];
double b[maxn];
double sum[maxn];
int main()
{
	int n;
	scanf(\"%d\",&n);
	for(int i = 0; i < n; i ++)
	{
		int x;
		double y;
		scanf(\"%d %lf\",&x,&y);
		a[x] += y;
		sum[x] = 1.0*a[x];
	}
	scanf(\"%d\",&n);
	for(int i = 0; i < n; i ++)
	{
		int x;
		double y;
		scanf(\"%d %lf\",&x,&y);
		b[x] += y;
		sum[x] += 1.0*b[x];
	}
	int count = 0;
	for(int i = maxn-1; i >= 0; i --)
		if(sum[i])
			count++;
	printf(\"%d\",count);
	for(int i = maxn-1; i >= 0; i --)
	{
		if(sum[i])
			printf(\" %d %.1lf\",i,sum[i]);
	} 
}