PAT_甲级_1103

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[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²​​ , or 11​^2​​ +6​²​​ +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.

注意点：
1、可能是英语太菜，这题读题读了好久
2、这是一个DFS模板题
3、有点类似背包问题，选与不选，注意和图的DFS比较记忆
4、题目有排序要求，从大的index往低选择，就直接满足了排序要求

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<stdio.h>
#include<vector>
using namespace std;
vector<int> arr, temp;
vector<int> ans;
int n, k, p;
int power(int x)
{
    int ans = 1;
    for (int i = 0; i < p; i++) {
        ans = ans * x;
    }
    return ans;
}
int maxFacSum = -1;
void DFS(int index, int now, int facSum, int sum)
{
    if (now == k && sum == n) {
        if (facSum > maxFacSum) {
            maxFacSum = facSum;
            ans = temp;
        }
        return;
    }
    if (now >= k || sum > n || index == 0) {
        return;
    }
    if (index - 1 >= 0) {
        temp.push_back(index);
        DFS(index, now + 1, facSum + index, sum + arr[index]);
        temp.pop_back();
        DFS(index - 1, now, facSum, sum);
    }
}
int main()
{
    cin >> n >> k >> p;
    for (int i = 0; power(i) <= n; i++) {
        arr.push_back(power(i));
    }
    DFS(arr.size() - 1, 0, 0, 0);
    if (maxFacSum == -1) {
        printf("Impossible\n");
    } else {
        printf("%d = %d^%d", n, ans[0], p);
        for (int i = 1; i < ans.size(); i++) {
            printf(" + %d^%d", ans[i], p);
        }
    }
    return 0;
}