PTA-Advance-1002
PROBLEM
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:
1 | 2 1 2.4 0 3.2 |
Sample Output:
1 | 3 2 1.5 1 2.9 0 3.2 |
ACCEPTED CODE
1 |
|
THINKING AND NOTICES
-
Creating a map from the exponents to coefficients. Add up the two coefficients of each exponents.
-
Print a zero(the total number of nonzero items) if the result of a+b is zero.
-
Map will sort your data by the keys in declining order, but you should print it in increasing order, so give map the third parameter – the class or struct name which has a member function like this:
bool operator() (const double& str1, const double& str2);
, a function (I’m not sure.)greater<int>
,or you can simply traversal the map from the end of it.
REFLECTION AND COMMENT
- Noting to reflect.