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 product 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 up to 1 decimal place.
Sample Input:
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output:
3 3 3.6 2 6.0 1 1.6
需要注意的是在value==0时要erase key
#include <iostream>
#include <map>
#include <vector>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int k_A,k_B;
map<int,double,greater<int>> poly_A,poly_B, poly_out;
void func(){
map<int,double>::iterator iter_A = poly_A.begin();
map<int,double>::iterator iter_B = poly_B.begin();
for(iter_A;iter_A!=poly_A.end();iter_A++){
for(iter_B = poly_B.begin();iter_B!=poly_B.end();iter_B++){
double tmp_A_out = iter_A->second*iter_B->second;
double tmp_K_out = iter_A->first+iter_B->first;
if (poly_out.count(tmp_K_out)){
poly_out[tmp_K_out] = tmp_A_out+poly_out[tmp_K_out];
}else{
poly_out[tmp_K_out] = tmp_A_out;
}
if(poly_out[tmp_K_out]==0){
poly_out.erase(tmp_K_out);
}
}
}
}
int main(int argc, char** argv) {
cin>>k_A;
int tmp_N;
double tmp_A;
for(int i=0;i<k_A;i++){
cin>>tmp_N>>tmp_A;
poly_A[tmp_N] = tmp_A;
}
cin>>k_B;
for(int i=0;i<k_B;i++){
cin>>tmp_N>>tmp_A;
poly_B[tmp_N] = tmp_A;
}
func();
printf("%d",poly_out.size());
for(map<int,double>::iterator iter = poly_out.begin();
iter!=poly_out.end();iter++){
printf(" %d %.1f",iter->first,iter->second);
}
return 0;
}