PAT 甲级 1002 A+B for Polynomials
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
结尾无空行
题意描述:
给定两个多项式A,B,每个多项式有相应的系数和指数,求A+B
解题思路:
可以考虑采用桶装数组来做,下标对应的就是指数,value对应的是系数,最后统计非零元素的个数,然后按指数从大到小输出即可。
难度评测:Normal
AC代码实现:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3+5;
double a[N];
int main() {
int k, e, s;
double c;
cin >> k;
for(int i = 0; i < k; i++) {
cin >> e >> c;
a[e] += c;
}
cin >> k;
for(int i = 0; i < k; i++) {
cin >> e >> c;
a[e] += c;
}
for(int i = 1000; i >= 0; i--)
if(a[i]) s++;
cout << s;
for(int i = 1000; i >= 0; i--) {
if(a[i]) printf(" %d %.1f", i, a[i]);
}
}