pat 1103 Integer Factorization

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

#include <iostream>
#include <vector>
#include <string>
#include <math.h>
using namespace std;

int n, m, p;
vector<int> vec, ans;
// Not use the pow function in math.h, because it can over time
int myPow(int x, int y) {
	int sum = 1;

	while(y--) {
		sum *= x;
	}

	return sum;
}

void factor(int index, int cnt, int curr, int remain) {
	if(cnt == 0) {
		if(curr == n && remain == 0) {
			ans.clear();
			for (int i = 0; i < vec.size(); ++i)
			{
				ans.push_back(vec[i]);
			}
		}
	}


	for (int i = index; i <= 20; ++i)
	{
		int tmp = myPow(i,p);

		if(tmp > remain || cnt == 0) return;
		vec.push_back(i);
		factor(i, cnt - 1, curr+tmp, remain-tmp);
		vec.pop_back();
	}

	
}
int main() {

	cin >> n >> m >> p;


	factor(1, m, 0, n);

	if(ans.empty()) {
		cout << "Impossible" <<endl;
	} else {
		cout << n << " = "; 
		for (int i = ans.size()-1; i >= 0; --i)
		{
			cout << ans[i] << "^" << p;
			if(i > 0) {
				cout << " + ";
			}
		}

		cout << endl;
	}
	
	return 0;
}