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 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 Specification:
For each test case you should output the sum of AAA and BBB 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<bits/stdc++.h>
using namespace std;
double a[1000],b[1000],c[1000];
int main()
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
int k, x;
double y;
scanf("%d",&k);
for(int i=1;i<=k;i++)
{
scanf("%d %lf",&x,&y);
a[x]=y;
c[x]++;
}
scanf("%d",&k);
for(int i=1;i<=k;i++)
{
scanf("%d %lf",&x,&y);
b[x]=y;
c[x]++;
}
int cnt=0;
for(int i = 0;i<=1000;i++)
{
c[i]=a[i]+b[i];
if(c[i]!=0)
cnt++;
}
cout<<cnt;
for(int i = 1000;i>=0;i--)
{
if((a[i]+b[i])!=0)
printf(" %d %.1lf",i,a[i]+b[i]);
}
cout<<endl;
return 0 ;
}