pat 1103 K-P多项式

题目描述：

1103. Integer Factorization (30)

时间限制

1200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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".

记录一下这道题是用dfs，虽然目前对剪枝的概念还不太了解，参照了网上的大神ac了这道题。

#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int factor[1000];
int res[1000];
int ans[1000];
int fdix=0;
int maxsum=0;
bool flag=false;
int N,K,P;
void dfs(int num,int cnt,int sum,int last){
    if(num==0&&cnt==0){
        if(sum>maxsum){
            flag=true;
            for(int i=1;i<=K;i++)
                ans[i]=res[i];
            maxsum=sum;
        }
        return;
    }
    else if(cnt==0)
        return;
    for(int i=min(fdix-1,last);i>=0;i--){
        int left=num-factor[i];
        if(left>=cnt-1){
            res[cnt]=i+1;
            dfs(left,cnt-1,sum+i+1,i);
        }
    }
    
}
int main(){
    cin>>N>>K>>P;
    int tmp=1;
    while(tmp<=N){
        factor[fdix]=tmp;
        fdix++;
        tmp=pow(fdix+1,P);
    }
    int last=fdix-1;
    dfs(N,K,0,last);
    if(flag){
        cout<<N<<" = ";
        for(int i=K;i>=1;i--)
            i==1?cout<<ans[i]<<"^"<<P:cout<<ans[i]<<"^"<<P<<" + ";
    }
    else
        cout<<"Impossible";
    return 0;
}