patA1103 dfs

#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
vector<int> fac,ans,temp;
int N,K,P;
int power(int x){
int ans=1;
for(int i=0;i<P;i++){
ans*=x;
}
return ans;
}
void init(){
int i=0,temp=0;
while(temp<=N){
fac.push_back(temp);
temp=power(++i);
}
}
int maxsum=-1;
void dfs(int index,int nowk,int sum,int subsum){
if(sum==N && nowk==K){
if(maxsum<subsum){
maxsum=subsum; 
ans=temp;               //更新最优底数的之和； 
}
return;
}
if(sum>N || nowk>K)  return;
if(index-1>=0){
temp.push_back(index);
dfs(index,nowk+1,sum+fac[index],subsum+index);
temp.pop_back();
dfs(index-1,nowk,sum,subsum);
}

}
int main(int argc, char** argv) {
scanf("%d%d%d",&N,&K,&P);
init();
dfs(fac.size()-1,0,0,0);
if(maxsum==-1) printf("Impossible\n");
else{
printf("%d = %d^%d",N,ans[0],P);
for(int i=1;i<ans.size();i++){
printf(" + %d^%d",ans[i],P);
}
}
return 0;
}