A1103 Integer Factorization (30 分)

#include <bits/stdc++.h>
using namespace std;
int n,k,p;//n = A1^p+...+Ak^p

vector<int> V_factor;
int MaxsumFac=-1;
vector<int> temp; //存储暂时的答案
vector<int> ans;  //存储最终的答案

void getFactor()
{
    int temp=0;
    int i=0;
    while(temp<=n)
    {
        V_factor.push_back(temp);
        temp = pow(++i,p);
    }
}

// void PrintTemp()
// {
//     for(vector<int>::iterator it = temp.begin();it!=temp.end();it++)
//     {
//         cout << *it << " ";
//     }
//     cout << "\n";
// }
void DFS(int index,int nowK,int sumSqu,int sumFac)
{
    //PrintTemp();
    //1.已经找到答案了
    if(nowK == k && sumSqu == n)
    {
        if(sumFac > MaxsumFac)
        {
            MaxsumFac = sumFac;
            ans = temp;
        }
        return;
    }
    //2.不会有答案的情况
    if(sumSqu > n || nowK > k)
        return;
    //3.继续往下遍历
    //假如选择index号
    if(index > 0)
    {
        temp.push_back(index);
        DFS(index,nowK+1,sumSqu+V_factor[index],sumFac+index);
        //如果不选index号
        temp.pop_back();
        DFS(index-1,nowK,sumSqu,sumFac);
    }
}

void printRes()
{
    printf("%d = %d^%d",n,ans[0],p);
    for(int i=1;i<k;i++)
    {
        printf(" + %d^%d",ans[i],p);
    }       
}
int main()
{
    scanf("%d%d%d",&n,&k,&p);
    //找到质因数
    getFactor();
    DFS(V_factor.size()-1,0,0,0);
    if(MaxsumFac == -1)
        printf("Impossible\n");
    else
        printRes();
}