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 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.
题目大意就是给两组数据,代表两个多项式,求出多项式相加后的结果。然后需要注意的是输出保留一位小数,数组也只需要开一个就可以了。
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1006;
double a[maxn];
int main()
{
int N;
cin >> N;
while(N--)
{
int n;
double m;
cin >> n >> m;
a[n] += m;
}
cin >> N;
while(N--)
{
int n;
double m;
cin >> n >> m;
a[n] += m;
}
int t = 0;
for(int i = 0;i<maxn;i++)
{
if(a[i]!=0) t++;
}
cout << t;
for(int i = maxn-1;i>=0;i--)
{
if(a[i]!=0)
{
printf(" %d %.1f",i,a[i]);
}
}
return 0;
}