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 <iostream>
#include <cstdio>
#define MAX 1001
using namespace std;
int main()
{
int k1=0,k2=0;
while(scanf("%d",&k1)!=EOF)
{
float a[MAX],co=0;
int ex=0,num=0;
for(int i=0;i<1001;i++)
a[i]=0;
for(int i=0;i<k1;i++)
{
scanf("%d%f",&ex,&co);
a[ex]+=co;
}
scanf("%d",&k2);
for(int i=0;i<k2;i++)
{
scanf("%d%f",&ex,&co);
a[ex]+=co;
}
for (int i=0;i<MAX;i++)
{
if(a[i]!=0)
num++;
}
printf("%d",num);
for (int i=MAX-1;i>=0;i--)
{
if(a[i]!=0)
printf(" %d %0.1f",i,a[i]);
}
}
return 0;
}
提交失败次数:1次
失败原因:输入的指数大小与输入的元素的个数无关,在遍历时,应遍历 所有元素而不是 输入的元素个数。
思考:由于此题中的指数为正整数,所以此题较为简单,但如果此题的指数可以为小数,又该如何做呢?