Submission #992530

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <cstdio>
#include <numeric>
#include <climits>
#include <cstring>
#include <map>
#include <utility>
#include <tuple>
#include <set>

using namespace std;
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << x << endl
bool possible(ll x, ll sum) {
    return x*(x + 1) / 2 >= sum;
}

void solve(ll n) {
    ll lb = 0, ub = n;
    while (lb + 1 < ub) {
        ll m = (lb + ub) / 2;
        if (possible(m, n)) {
            ub = m;
        } else {
            lb = m;
        }
    }
    int rem = n;
    int x = ub;
    while (rem) {
        int sub = min(rem, x);
        cout << sub << endl;
        rem -= sub;
        x = sub - 1;
    }
}

signed main() {
    ll n;
    while (cin >> n) {
        solve(n);

    }
    //for (int i = 1; i < 1000; i++) {
    //    solve(i);
    //}
}

Submission Info

Judge Result