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
using namespace std;
int main()
{
cout<<fixed<<setprecision(1);
float sum[1001]={0};
int a,b,c;
float num;
cin>>a;
for(int i=0;i<a;i++)
{
cin>>c>>num;
sum[c]+=num;
}
cin>>b;
for(int i=0;i<b;i++)
{
cin>>c>>num;
sum[c]+=num;
}
int total=0;
for(int i=0;i<1001;i++)
{
if(sum[i]!=0)
total++;
}
cout<<total;
for(int i=1000;i>=0;i–)
{
if(sum[i]!=0)
cout<<’ ‘<<i<<’ '<<sum[i];
}
return 0;
}