每日AC

#include <iostream>
#include <vector>
#include <cmath>
#include <climits>

using namespace std;

int main() {

int m;
cin >> m;
vector<int> quads;
int x = 1;
while (true) {
    long long x4 = (long long)x * x * x * x;
    if (x4 > m) break;
    quads.push_back(x4);
    x++;
}
vector<int> dp(m + 1, INT_MAX);
dp[0] = 0;
for (int i = 1; i <= m; ++i) {
    for (int quad : quads) {
        if (i >= quad && dp[i - quad] != INT_MAX) {
            dp[i] = min(dp[i], dp[i - quad] + 1);
        }
    }
}
vector<int> ans;
int current = m;
int k = dp[m];
while (k > 0) {
    int x_max = pow(current, 1.0 / 4);
    while ((x_max + 1) <= current) {
        long long next_x4 = (long long)(x_max + 1) * (x_max + 1) * (x_max + 1) * (x_max + 1);
        if (next_x4 > current) break;
        x_max++;
    }
    bool found = false;
    for (int x = x_max; x >= 1; --x) {
        long long x4 = (long long)x * x * x * x;
        if (x4 > current) continue;
        int next = current - x4;
        if (next < 0) continue;
        if (dp[next] == k - 1) {
            ans.push_back(x);
            current = next;
            k--;
            found = true;
            break;
        }
    }
    if (!found) {
        break;
    }
}
for (size_t i = 0; i < ans.size(); ++i) {
    if (i > 0) cout << " ";
    cout << ans[i];
}
cout << endl;

return 0;

}