Submission #991986

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,s,n) for(int i=s; i<n; ++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX

typedef long long ll;
typedef pair<int, int> ii;

/*
class Node {
public:
  int num;
  int index;
  bool operator<(const Node& b) const {
    if(num < b.num) return (num < b.num);
    else return index > b.index;
  }

  Node(){
    num=0; index=0;
  }
  Node(int n, int i) : num(n), index(i){
  }
};
*/

int main(){
  ll n;
  cin >> n;
  ll i = 0;
  while(i*(i  +1) < 2 * n){i++;}
  i--;
  if(i*(i+ 1) == 2*n){
    REP(j, 1, i+1) cout <<j<<endl;
  }
  else{
    ll sa = n - i * (i+1) / 2;
    REP(j, 1, i  + 1 - sa) cout << j<<endl;
    REP(j, i + 2 - sa, i + 2) cout << j <<endl;
  }



  return 0;
}

Submission Info

Judge Result