1002 A+B for Polynomials (25 point(s))
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
//注意double和float区别
#include<iostream>
#include<cstring>
using namespace std;
const int MAX = 2010;
double coe[MAX];
int main(void)
{
memset(coe,0,sizeof(coe));
int a_i,b_i,exp;
float c;
scanf("%d",&a_i);
for(int i=0;i<a_i;i++){
scanf("%d%f",&exp,&c);
coe[exp]+=c;
//printf("%f\n",coe[exp]);
}
scanf("%d",&b_i);
for(int i=0;i<b_i;i++){
scanf("%d%f",&exp,&c);
coe[exp]+=c;
}
int k=0;
for(int i=MAX;i>=0;i--){
if(coe[i]!=0) k++;
}
printf("%d",k);
for(int i=MAX;i>=0;i--){
if(coe[i]!=0){
printf(" %d %.1f",i,coe[i]);
}
}
printf("\n");
return 0;
}
https://pintia.cn/problem-sets/994805342720868352/problems/994805526272000000