A+B for Polynomials

来源:互联网 发布:优化英文网站 编辑:程序博客网 时间:2024/05/20 10:11

Input

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

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.22 2 1.5 1 0.5
Sample Output
3 2 1.5 1 2.9 0 3.2
#include <iostream>#include <iomanip>using namespace std;float a[1001]={0.0};int main(){int m,n,t,cnt=0;float p;cin>>m;while(m--){cin>>t>>p;a[t]=p;}cin>>n;while(n--){cin>>t>>p;a[t]=a[t]+p;}for(int i=1000;i>=0;--i){if(a[i])cnt++;}cout<<cnt;for(int i=1000;i>=0;--i){if(a[i]!=0)cout<<" "<<i<<" "<<fixed<<setprecision(1)<<a[i];//设置小数点后1位}cout<<endl;return 0;}


0 0
原创粉丝点击