1002 A+B for Polynomials
- A、B各最多10个指数,相加最多20个(C)
- 其实整体思路有点像用链表表示的多项式相加
- 注意判断系数相加为0的情况——不输出,num也不加,但是A、B继续后移
- 格式控制,保证0输出为0.0
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
pair<int, double> AB[2][10], C[20];
int K[2], pos_A = 0, pos_B = 0, num = 0;
for (int i = 0; i < 2; i++) {
cin >> K[i];
for (int j = 0; j < K[i]; j++)
cin >> AB[i][j].first >> AB[i][j].second;
}
while (K[0] && K[1]) {
if (AB[0][pos_A].first > AB[1][pos_B].first) {
C[num++] = AB[0][pos_A++];
K[0]--;
} else if (AB[0][pos_A].first < AB[1][pos_B].first) {
C[num++] = AB[1][pos_B++];
K[1]--;
} else { // ==
if (AB[0][pos_A].second + AB[1][pos_B].second != 0) {
C[num].first = AB[0][pos_A].first;
C[num++].second = AB[0][pos_A].second + AB[1][pos_B].second;
}
pos_A++; pos_B++; K[0]--; K[1]--;
}
}
while(K[0]-- > 0) C[num++] = AB[0][pos_A++];
while(K[1]-- > 0) C[num++] = AB[1][pos_B++];
cout << num;
for (int i = 0; i < num; i++) {
cout << " " << C[i].first << " ";
cout << fixed << setprecision(1) << C[i].second;
}
}