Submission #3907866

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

typedef long long llong;


llong sum[10000005];

int main()
{
    llong n;
    llong pnt = 0;
    llong maxv;

    cin >> n;

    for (llong i = 1; i <= n; i++) {
        sum[i] = sum[i - 1] + i;
    }


    while (n) {
        maxv = lower_bound(sum, sum + n, n) - sum;
        cout << maxv << endl;

        n = n - maxv;
    }

    return 0;
}

Submission Info

Judge Result