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
分析:创建大小为1001的数组,数组的下标就是指数,对应放的就是系数,然后进行读数,每读进来一对指数和系数,就直接把系数加上去,然后统计非零项的个数,再按要求输出即可。
#include<iostream>
using namespace std;
void add(double* arr);
int main() {
double arr[1001] = { 0 };
add(arr);
add(arr);
int i = 0, cnt = 0;
while (i < 1001) {
if (arr[i]) cnt++;
i++;
}
cout << cnt;
for (int i = 1000; i >= 0; i--) {
if (arr[i]) printf(" %d %.1f", i, arr[i]);
}
return 0;
}
void add(double *arr)
{
int K, exp;
double pol;
scanf_s("%d", &K);
for (int i = 0; i < K; i++) {
scanf_s("%d %lf", &exp, &pol);
arr[exp] += pol;
}
}