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.
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
注意:
1、double数组要初始化为0
2、结果系数为0的项数,不需要打印出来
3、不要过度依赖容器,这道题用map容器反而更复杂了
我的代码
#include<cstdio>
const int maxn = 1010;
int main()
{
int k,n;
double p[maxn] = {0},num;
for (int j = 0 ;j < 2 ;j++)
{
scanf("%d",&k);
for (int i = 0 ;i < k ;i++)
{
scanf("%d%lf",&n,&num);
p[n] += num;
}
}
int cnt = 0;
for (int i = 0 ;i < maxn ;i++)
{
if (p[i] != 0)
cnt++;
}
printf("%d",cnt);
for (int i = maxn - 1;i >= 0 ;i--)
{
if (p[i] != 0)
printf(" %d %.1f",i,p[i]);
}
return 0;
}