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
代码长度限制
16 KB
时间限制
400 ms
内存限制
64 MB
#include <iostream>
using namespace std;
const int LEN = 1010;
double a[LEN], b[LEN], sum[LEN];
int main() {
int n, maxTop = 0;
cin >> n;
while( n -- ){
int top;
double base;
cin >> top >> base;
if(top > maxTop || !maxTop) maxTop = top;
a[top] = base;
}
cin >> n;
while( n-- ){
int top;
double base;
cin >> top >> base;
if(top > maxTop || !maxTop) maxTop = top;
b[top] = base;
}
int cnt = 0;
for(int i = maxTop; i >= 0 ; i-- ){
sum[i] = a[i] + b[i];
if(sum[i]) cnt ++;
}
cout << cnt;
for(int i = maxTop; i >= 0 ; i-- ){
if(sum[i]) printf(" %d %.1lf", i , sum[i]);
}
return 0;
}
总结
1. 简单的多项式问题,只需要将对应指数的系数相加后输出即可。
2. 一般考虑开辟最大数组来存储所有系数,然后筛选出有用的数据输出即可。关键是筛选。