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
一开始一直在考虑0是否要输出的问题,仔细审题后发现,要按照输入格式输出,输入格式中的0是省略的。还走过一个转化成int相加再转成浮点型的坑。
#include<stdio.h>
#include<math.h>
int main(){
int k,max=0,m;
double n;
double a[1005]={0},b[1005]={0},c[1005]={0};
scanf("%d",&k);
for (int i=0;i<k;i++){
scanf("%d",&m);
if (m>max) max=m;
scanf("%lf",&a[m]);
}
scanf("%d",&k);
for (int i=0;i<k;i++){
scanf("%d",&m);
if (m>max) max=m;
scanf("%lf",&b[m]);
}
for (int i=0;i<=max;i++)
c[i]=a[i]+b[i];
k=0;
for (int i=max;i>=0;i--)
if (c[i]!=0) {
k++;
}
printf("%d",k);
for (int i=max;i>=0;i--)
if (c[i]!=0) printf(" %d %.1lf",i,c[i]);
printf("\n");
return 0;
}
欢迎指导和交流!