pat-a1103. Integer Factorization (30)

自己想的深搜比较复杂，看了宝典的思路。。先把factor存好再去就行。

第4个测试点是1 1 2.。开始没注意边界这个点会输出impossible。。

#include<cstdio>
#include<vector>
using namespace std;
int fac[1000];
int ans=0,k;
vector<int> vi,a;
int power(int i,int p){
	int ans=1;
	while(p--) ans*=i;
	return ans;
}
void dfs(int cur,int sum,int n,int r,int cmax){
	if(r>k) return;
	else if(r==k){
		if(sum==n){
			if(cmax>ans){
				ans=cmax;
				int len=vi.size();
				a=vi;
			}
		}
		return;
	}
	for(int i=cur;i!=-1;--i){
		if(sum+fac[cur]<=n){
			vi.push_back(cur+1);
			dfs(i,sum+fac[cur],n,r+1,cmax+cur+1);
			vi.pop_back();
		}
	}
}
int main(){
	int n,p,t=0,r=0,cmax=0,sum=0;//r代表目前个数 ，应该小于k ,cmax记录当前因子和 
	scanf("%d%d%d",&n,&k,&p);
	for(int i=0;i<=n;++i)
	 if(power(i+1,p)<=n) fac[i]=power(i+1,p);
	 else{
	 	t=i;
	 	break;
	 }
	for(int i=t-1;i!=-1;--i)
	 dfs(i,sum,n,r,cmax);
	if(a.size()){
		printf("%d = %d^%d",n,a[0],p);
		for(int i=1;i<k;++i) printf(" + %d^%d",a[i],p);
	}
	else printf("Impossible");
	printf("\n"); 
	return 0;
} 

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₁^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² + 4² + 2² + 2² + 1², or 11²+ 6² + 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₁, a₂, ... a_K } is said to be larger than { b₁, b₂, ... 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