1103 Integer Factorization

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

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
//maxFacSum记录最大底数之和
int n,k,p,maxFacSum = -1;
//fac记录0^p,1^p,2^p使得i^p为不超过n的最大数
//ans存放最优底数序列，temp存放递归中的临时序列
vector<int> fac,ans,temp;
//power函数计算x^p
int power(int x)
{
	int ans=1;
	for(int i=0;i<p;i++)
	{
		ans *=x;
	}
	return ans;
} 
//init函数预处理fac数组，注意把0也存进去
void init()
{
	int i=0,temp=0;
	while(temp <= n)
	{
		
		fac.push_back(temp);
		temp=power(++i); 
	}
} 
//DFS函数，当前访问fac[index],nowk为当前选中个数
//sum为当前选中的数之和，facSum为当前选中的底数之和
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);//把底数index加入临时序列temp
		DFS(index,nowK+1,sum+fac[index],facSum+index);//'选'的分支 
		temp.pop_back();// "选"的分支结束后把刚加进去的数pop掉
		DFS(index-1,nowK,sum,facSum);//不选分支
		 
	}
}
int main()
{
   
  scanf("%d%d%d", &n, &k, &p); 
	init();//初始化数组
	DFS(fac.size()-1,0,0,0);//从fac的最后一位开始往前搜索
	if(maxFacSum==-1)
	printf("Impossible\n");//没有找到满足的序列
	else
	{
		printf("%d = %d^%d",n,ans[0],p);//输出ans的结果
		for(int i=1;i<ans.size();i++)
		{
			printf(" + %d^%d",ans[i],p);
		} 
	} 
	return 0;
}