PAT日志 1103

顽强的小白

1103 Integer Factorization （30 分）

The K−P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program to find the K−P factorization of N for any positive integers N, K and P.

Input Specification:

Each input file contains one test case which gives in a line the three positive integers N (≤400), K (≤N) and P (1<P≤7). The numbers in a line are separated by a space.

Output Specification:

For each case, if the solution exists, output in the format:
N = n[1]^P + … n[K]^P
where n[i] (i = 1, …, K) is the i-th factor. All the factors must be printed in non-increasing order.
Note: the solution may not be unique. For example, the 5-2 factorization of 169 has 9 solutions, such as 12​2​​+4​2​​+2​2​​+2​2​​+1​2​​, or 11​2​​+6​2​​+2​2​​+2​2​​+2​2​​, or more. You must output the one with the maximum sum of the factors. If there is a tie, the largest factor sequence must be chosen – sequence { a​1​​,a​2​​,⋯,a​K​​ } is said to be larger than { b​1​​,b​2​​,⋯,b​K​​ } if there exists 1≤L≤K such that a​i​​=b​i​​ for i<L and a​L​​>b​L​​.
If there is no solution, simple output Impossible.

Sample Input 1:

169 5 2

Sample Output 1:

169 = 6^2 + 6^2 + 6^2 + 6^2 + 5^2

Sample Input 2:

169 167 3

Sample Output 2:

Impossible

题目解析

题目要求给出一个数字 ，根据要求的元素个数，给定的次方，分解这个数。
类似这种的迷宫题目，一般用的是DFS，遍历所有路径分支，找出最优解，题目也要求了，输出的结果必须是元素和最大的结果。

• 预处理：
• 根据所给的数可以判断简单判断能用的最大的元素，放到容器中，方便使用
• DFS：
• 设置当前使用的元素个数nowK，当前元素次方和sum，当前元素和facSum
• 如果满足满足个数以及和，还要再判断是否是最大的结果，是的话更新最大结果。
• 产生分支的部分：
• 是否选用当前的index，选择的话，更新nowK , sum , facSum.
• 不选的话只需要更新index,也就是进入下一个index;

代码实现

int maxFacSum=-1;
vector<int> fac,temp,ans;
int power(int x){
 int ans=1;
 for(int i=0;i<p;++i){
  ans*=x;
 }
 return ans;
}
void init(){             //预处理 
 int i=0,t=0;         //主要是找到能用的最大元素 
 while(t<=n){  //能省下很多运算时间 
  fac.push_back(t);
  t=power(++i);
 }
}
void DFS(int index,int nowK,int sum,int facSum){
 if(sum==n&&nowK==k){     //有结果 
  if(facSum>maxFacSum){ //择优处理 
   ans=temp;
   maxFacSum=facSum;
  }
  return; 
 }
 if(sum>n||nowK>k) return; //表示这条路无结果 
 if(index-1>=0){      //生成分支 
  temp.push_back(index);
  DFS(index,nowK+1,sum+fac[index],facSum+index);//选择index 
  temp.pop_back();
  DFS(index-1,nowK,sum,facSum);       //不选择index 
 } 
}
int main(){
 scanf("%d%d%d",&n,&k,&p);
 init();
 DFS(fac.size()-1,0,0,0);      //从大往小生成分支
 if(maxFacSum==-1) printf("Impossible") ;
 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;
}