Submission #992260

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <queue>
#include <set>
#include <cstdlib>

using namespace std;
typedef long long int ll;

bool debug;
#define show(x) if (debug) {cout << "" # x << " = " << x << endl;}
#define rep(x, a, b) for (int x = a; x < b; x++)

int main(int argc, char **argv)
{
  (void)argv; debug = argc > 1;

  show(debug);

  int n;
  cin >> n;

  show(n);

  ll l = 0, r = 20000000;

  while (r - l > 1) {
    show(r);
    show(l);
    ll m = (l + r) / 2;
    if (m * (m + 1) / 2 <= n) {
      l = m;
    } else {
      r = m;
    }
  }

  ll sum = l * (l + 1) / 2;
  
  rep (i, 0, l) {
    cout << l - i + ((i < n - sum) ? 1 : 0) << endl;
  }

  return 0;
}

Submission Info

Judge Result