1103. Integer Factorization (30) dfs

#include <iostream>
#include <cmath>
#include <vector>
using namespace std;

int n, k, p, maxFacSum = -1; // n 和  k 几个数字 p阶数
vector<int> v, ans, tempAns;

void init(){//将1到n的每一p次方都存储 减少计算量
    int temp = 0, index = 1;
    while(temp <= n){
        v.push_back(temp);
        temp = pow(index, p);
        index++;
    }
}

void dfs(int index, int tempSum, int tempK, int facSum){
    if (tempSum == n && tempK == k) {//递归终止条件
        if (facSum > maxFacSum) {//条件选取最大的Sum
            ans = tempAns;
            maxFacSum = facSum;
        }
        return;
    }
    if(tempSum > n || tempK > k) return; //循环终止条件
    if (index >= 1) {//以下过程一直持续到 index = 1
        tempAns.push_back(index);//0
        dfs(index, tempSum + v[index], tempK + 1, facSum + index);//首先递归调用index
        tempAns.pop_back();//不满足条件 删除最后一个元素
        dfs(index - 1, tempSum, tempK, facSum);//再递归调用index-1
    }
}

int main(int argc, const char * argv[]) {
    cin >> n >> k >> p;
    init();
    dfs((int)v.size() - 1, 0, 0, 0);
    if (maxFacSum == -1) {
        cout << "Impossible\n";
        return 0;
    }
    cout << n << " = ";
    for (int i = 0; i < ans.size(); i++) {
        if(i != 0) cout << " + ";
        cout << ans[i] << "^" << p;
    }
    cout << endl;

    return 0;
}