A1103 Integer Factorization （30 分）深度优先遍历

#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
int n, k, p;
vector<int> temp, ans, fac;
void init()//预处理
{
	int mid;
	for (int i = 0; pow(1.0*i, 1.0*p) <= n; i++)
	{
		mid = pow(1.0*i, 1.0*p);
		//printf("%d\n", mid);
		fac.push_back(mid);
	}
}
int maxfac = -1;
void dfs(int index, int nowk, int sum, int facsum)
{
	if (sum == n && nowk == k)
	{
		if (facsum > maxfac)
		{
			ans = temp;
			maxfac = facsum;
		}
		return;
	}
	if (sum > n || nowk > k) return;
	if (index >= 1)
	{
		temp.push_back(index);
		dfs(index, nowk + 1, sum + fac[index], facsum + index);
		temp.pop_back();
		dfs(index - 1, nowk, sum, facsum);
	}
}
int main()
{
	scanf("%d%d%d", &n, &k, &p);
	init();
	dfs(fac.size() - 1, 0, 0, 0);
	if (maxfac == -1) printf("Impossible\n");
	else
	{
		printf("%d =", n);
		for (int i = 0; i < ans.size(); i++)
		{
			printf(" %d^%d", ans[i], p);
			if (i != ans.size() - 1) printf(" +");
		}
	}
	return 0;
}