PAT (Advanced Level) 1103 Integer Factorization （30 分）

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

Code:

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#pragma warning(disable:4996)

using namespace std;

vector<vector<int>> ans;
vector<int> temp;
int n, k, p, limit;
void dfs(int index, int nowK, int sum)
{
	if (index < 1 || nowK > k || sum > n) return;
	if (nowK == k && sum == n) {
		ans.push_back(temp);
		return;
	}
	temp.push_back(index);
	dfs(index, nowK + 1, sum + (int)pow(index * 1.0, p * 1.0));
	temp.pop_back();
	dfs(index - 1, nowK, sum);
}

int main()
{
	scanf("%d%d%d", &n, &k, &p);
	limit = pow(n * 1.0 - k + 1, 1.0 / p);
	dfs(limit, 0, 0);
	auto cmp = [](const vector<int>& v1, const vector<int>& v2)->bool {
		int sum1 = 0, sum2 = 0;
		bool flag = true, flag2 = false;
		for (int i = 0; i < v1.size(); i++)
		{
			sum1 += v1[i];
			sum2 += v2[i];
			if (!flag2 && sum1 < sum2)
			{
				flag = false;
				flag2 = true;
			}
		}
		if (sum1 > sum2) return true;
		else if (sum1 < sum2) return false;
		else return flag;
	};
	if (ans.empty()) printf("Impossible\n");
	else {
		int ans_i = 0;
		for (int i = 1; i < ans.size(); i++)
			if (cmp(ans[i], ans[ans_i]))
				ans_i = i;
		printf("%d = %d^%d", n, ans[ans_i][0], p);
		for (int i = 1; i < ans[ans_i].size(); i++)
			printf(" + %d^%d", ans[ans_i][i], p);
		printf("\n");
	}
	return 0;
}