1009. Product of Polynomials (25)
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 Input2 1 2.4 0 3.2 2 2 1.5 1 0.5Sample Output
3 3 3.6 2 6.0 1 1.6
分析:
此题看上去很简单。其实有很多需要注意的地方,比如系数为0的时候改怎么处理,采用什么样的东西来存储等等。笔者花了1个小时左右的时间才完全AC这道题。
C++代码如下。
#include<iostream>
#include<vector>
#include<iomanip>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> Aexponents,Bexponents,Resexponents;
vector<double> Acoefficients,Bcoefficients,Rescoefficients;
for(int i=0;i<N;i++){
int temp1;
cin>>temp1;
Aexponents.push_back(temp1);
double temp2;
cin>>temp2;
Acoefficients.push_back(temp2);
}
int M;
cin>>M;
for(int i=0;i<M;i++){
int temp1;
cin>>temp1;
Bexponents.push_back(temp1);
double temp2;
cin>>temp2;
Bcoefficients.push_back(temp2);
}
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
int exptemp=Aexponents[i]+Bexponents[j];
// Resexponents[i*M+j]= ;
double cofftemp= (double)Acoefficients[i]*(double)Bcoefficients[j];
if(cofftemp==0) {break;
};
//cout<<Rescoefficients[i*M+j]<<endl;
bool isExist=false;
for(int k=0;k<Resexponents.size();k++){
if(Resexponents[k]==exptemp){
Rescoefficients[k]+=cofftemp;
if(Rescoefficients[k]==0){//remove
std::vector<int>::iterator it = Resexponents.begin()+k;
Resexponents.erase(it);
std::vector<double>::iterator it1 = Rescoefficients.begin()+k;
Rescoefficients.erase(it1);
}
isExist=true;
}
}
if(!isExist){
if(cofftemp!=0){
Resexponents.push_back(exptemp);
Rescoefficients.push_back(cofftemp);//
}
// else{
// Resexponents.push_back(0);
// Rescoefficients.push_back(0);//
// }
}
}
}
cout<<Resexponents.size()<<" ";
int NN=(int)Resexponents.size();
if(NN==0){
cout<<"0 0";
}
for(int i=0;i<NN;i++){
// cout<<NN;
int big=-1000000;
int big_index=-1;
for(int j=0;j<(int)Resexponents.size();j++){
if(big<Resexponents[j]){
big=Resexponents[j];
big_index=j;
}
}
if(i==NN-1)
cout<<Resexponents[big_index]<<" "<<fixed<<setprecision(1)<<Rescoefficients[big_index];
else
cout<<Resexponents[big_index]<<" "<<fixed<<setprecision(1)<<Rescoefficients[big_index]<<" ";
std::vector<int>::iterator it = Resexponents.begin()+big_index;
Resexponents.erase(it);
std::vector<double>::iterator it1 = Rescoefficients.begin()+big_index;
Rescoefficients.erase(it1);
}
return 0;
}
测试点全部通过。