daima
1002 A+B for Polynomials
作者 CHEN, Yue
单位 浙江大学
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 <iostream>
#include <string>
#include <iomanip>
using namespace std;
double A[1010];
int n, m;
int main() {
for (int i = 0; i <= 1000; ++i)A[i] = 0;
int a; double b;//read b*X^a
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a >> b;
A[a] += b;
}
cin >> m;
for (int i = 1; i <= m; ++i) {
cin >> a >> b;
A[a] += b;
}
int cnt = 0;
for (int i = 0; i <= 1000; ++i)if (A[i] !=0)++cnt;
cout << cnt;
for (int i = 1000; i >= 0; --i)if (A[i] !=0)cout << " " << i << " " << fixed << setprecision(1) << A[i];
return 0;
}
同1009题
因为通过了1009的测试0才发现1002这题一直用例6不过关也是一样的道理
都是指数不为0时就可以输出了
好吧!