Submission #991974

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int main() {

  ll N; cin >> N;

  ll XX = 1e15;

  rep(i, N) {
    ll ok = 0;  // compare(ok) is always true
    ll ng = N + 1;    // compare(ng) is always false

    auto compare = [&](ll X)
      -> pair<ll, ll>
    {
      return {X, N - (1 + X) * (2 + X) / 2LL >= 0LL};
    };
    
    while(abs(ok-ng) > 1) { // ng極限の隣がokとなるまで
      ll mid = (ok + ng) / 2;
      auto r = compare(mid);
      if(r.second) {
        ok = mid;
        XX = r.first;
      } else {
        ng = mid;
      }
//      (compare(mid) ? ok : ng) = mid;
    }

    rep(i, XX) {
      cout << i + 1 << endl;
    }
    cout << ok << endl;

  }
  
  return 0;
}

Submission Info

Judge Result