Submission #6148836

---

Source Code Expand

#include <bits/stdc++.h>

#define ALL(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0, __##i##_length = (n); i < __##i##_length; i++)
#define rep_reverse(i, n) for (ll i = (n)-1; 0 <= i; i--)
#define FOR(i, from, to) for (ll i = (from), __##i##_end = (to); i < __##i##_end; i++)
#define FOR_REVERSE(i, from, to) for (ll i = (to)-1, __##i##_end = (from); __##i##_end <= i; i--)
#define foreach(e, v) for (const auto e : (v))
#define vfree(v) std::vector<int>().swap(v)
#define DEBUG(x) cout << #x << " = " << (x) << endl

using namespace std;
typedef int64_t ll;
typedef vector<ll> llv;
typedef vector<llv> llvv;

ll gcd(ll a, ll b)
{
    return (a < b) ? gcd(b, a) : ((a % b) ? gcd(b, a % b) : b);
}

ll lcm(ll a, ll b)
{
    return a * b / gcd(a, b);
}

int main()
{
    ll N;
    cin >> N;

    ll ok = 1;
    ll ng = N;
    while (1 < ng - ok)
    {
        ll n = ok + (ng - ok) / 2;
        ll sum = n * (n + 1) / 2;
        if (sum < N)
        {
            ok = n;
        }
        else
        {
            ng = n;
        }
    }

    ll sum = ng * (ng + 1) / 2;
    ll a = sum - N;
    for (ll i = 1; i < ng + 1; i++)
    {
        if (i != a)
            cout << i << endl;
    }

    return 0;
}

Submission Info

Judge Result