A+B for 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 
using namespace std;
float a[1001]={0.0};
int main()
{
	int m,n,t,cnt=0;
	float p;
	cin>>m;
	while(m--)
	{
		cin>>t>>p;
		a[t]=p;
	}
	cin>>n;
	while(n--)
	{
		cin>>t>>p;
		a[t]=a[t]+p;
	}
	for(int i=1000;i>=0;--i)
	{
		if(a[i])
			cnt++;
	}
	cout<=0;--i)
	{
		if(a[i]!=0)
			cout<<" "<


你可能感兴趣的:(C++,pat)