PAT(A) - 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₁^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

思路分析：DFS搜索，注意剪枝，否则会超时。

#include <cstdio>
#include <vector>

using namespace std;

int N, K, P;
int limit;
vector<int> temp;
vector<int> path;
int maxFac = 0;

int myPow( int n ) {
    int ans = 1;
    for( int i = 0; i < P; i++ ) {
        ans = ans * n;
    }
    return ans;
}

void dfs( int curSum, int cur, int curCnt ) {
    if( curSum == N ) {
        if( curCnt != K ) return;
        int curFac = 0;

        for( int i = 0; i < temp.size(); i++ ) {
            curFac += temp[i];
        }

        if( curFac > maxFac ) {
            maxFac = curFac;
            path = temp;
        }
        else if( curFac == maxFac ) {
            for( int i = temp.size() - 1, j = path.size() - 1; i >= 0 && j >= 0; i--, j-- ) {
                if( temp[i] > path[j] ) {
                    path = temp;
                    break;
                }
            }
        }
        return;
    }

    for( int i = cur; i <= limit; i++ ) {
        int next = myPow( i );
        if( curSum + next > N ) break;
        else if( curCnt < K ) {
            temp.push_back( i );
            dfs( curSum + next, i, curCnt + 1 );
            temp.pop_back();
        }

    }
}

int main() {
    scanf( "%d%d%d", &N, &K ,&P );

    for( int i = 1; i <= N; i++ ) {
        int next = myPow( i );
        if( next >= N ) {
            limit = i;
            break;
        }
    }

    dfs( 0, 1, 0 );

    if( path.empty() ) {
        printf( "Impossible\n" );
        return 0;
    }

    printf( "%d = ", N );
    for( int i = path.size() - 1; i >= 0; i-- ) {
        if( i == path.size() - 1 ) printf( "%d^%d", path[i], P );
        else printf( " + %d^%d", path[i], P );
    }

    return 0;
}