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₁^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

问题分析：深搜咯，不过有几个要注意的地方

                1.一定是sum >=maxn,而不仅仅是大于，因为说了“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”，就是当和相同时，取数较大的一个序列，即（6,6,4,4,1）比（6,6,5,3,1）大，那么就肯定是最后一个最佳值

                2.这里用pow的话算出来有问题

                3.输出格式要注意，很容易出错

                4.我本来是在dfs里判断的时候是用的 i<=sqrt(n)+1,结果段错误，还不明白是什么原因....

#include<bits/stdc++.h>
#include<vector>
using namespace std;

int maxn = 0;
int flag;
int num[25];
vector<int>ans,v;

void dfs(int start,int sum,int n,int k)
{
	if (k == 0 && n == 0){
		if (sum >= maxn){
			maxn = sum;
			ans = v;
			return ;
		}
	}

	for(int i = start; i <= 20; i++){
		if (n - num[i] < 0)
			break;
		v.push_back(i);
		dfs(i,sum+i,n-num[i],k-1);
		v.pop_back();
	} 
}

int main()
{
	int n,k,p;
	cin >> n >> k >> p;
	
	for(int i = 1; i <= 20; i++){
		num[i] = 1;
		for(int j = 0; j < p; j++)
			num[i] *= i;
	}

	dfs(1,0,n,k);
	
	if (ans.size() == 0)
		cout << "Impossible" << endl;
	else{
		cout << n << " = ";
                for(int i = ans.size()-1; i >= 0; i--){
                printf("%d^%d",ans[i],p);
                if (i != 0)
                    printf(" + ");
                } 
		cout << endl;
	} 
	return 0;		
}