Submission #991859

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define repeat_from_reverse(i,m,n) for (int i = (n)-1; (i) >= (m); --(i))
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
typedef long long ll;
using namespace std;
template <class T> void setmax(T & a, T const & b) { if (a < b) a = b; }
template <class T> void setmin(T & a, T const & b) { if (b < a) a = b; }
template <typename T, typename X> auto vectors(T a, X x) { return vector<T>(x, a); }
template <typename T, typename X, typename Y, typename... Zs> auto vectors(T a, X x, Y y, Zs... zs) { auto cont = vectors(a, y, zs...); return vector<decltype(cont)>(x, cont); }
int main() {
    int n; cin >> n;
    vector<int> dp(n+1, -1);
    dp[0] = 0;
    repeat (k,n+1) {
        repeat_reverse (i,n+1-k) {
            if (dp[i] != -1 and dp[i+k] == -1) {
                dp[i+k] = i;
            }
        }
        if (dp[n] != -1) break;
    }
    // repeat (i,n+1) cerr << i << ' ' << dp[i] << endl;
    for (int k = n; k != 0; k = dp[k]) {
        cout << k - dp[k] << endl;
    }
    return 0;
}

Submission Info

Judge Result