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
#include<cstdio>
int main()
{
double a1[1000]={0},a2[1000]={0};
int i,count=0;
int k1,k2;
scanf("%d",&k1);
while(k1--) { //读入第一行多项式
scanf("%d",&i); //次数为i,系数 是a1[i] 不能一句话读入,因为i在两句都出现了
scanf("%lf",&a1[i]);
}
scanf("%d",&k2); //读入第二行多项式
while(k2--) {
scanf("%d",&i); //次数为i,系数 是a2[i]
scanf("%lf",&a2[i]);
if(a1[i]==0) a1[i]=a2[i]; //如果i次项 在第一行不存在,加入i次项
else a1[i]+=a2[i]; //如果两行都有i次项,加和
}
for(i=0; i<1000; i++) {
if(a1[i] != 0) count++;
}
printf("%d",count);
for(i=1000; i>=0; i--) { //输出
if(a1[i] != 0) { //如果系数不为零
printf(" %d %.1f",i,a1[i]);
}
}
return 0;
}