(甲) 1002 A+B for Polynomials
阿新 • • 發佈:2018-12-12
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
key
#include <iostream> #include <iomanip> using namespace std; int main() { int count=2; double a[1005]={0}; while(count--) { int k; cin>>k; int x; double y; while(k--) { cin>>x>>y; a[x]+=y; } } int noze=0; for(int i=0;i<1001;i++) { if(a[i]) noze++; } cout<<noze; for(int i=1001;i>=0;i--) { if(a[i]) cout<<" "<<i<<" "<<fixed<<setprecision(1)<<a[i]; } return 0; }