Submission #991792

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define INF 1<<30
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

bool ch(ll x, ll n) {
	ll res = n;
	for(ll i = x; i >= 1; i--) {
		if(res >= i) {
			res -= i;
		}
	}

	return res == 0;
}

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

	ll l = 0, r = n;
	while(r - l > 1) {
		ll mid = (r + l) / 2;
		if(ch(mid, n)) {
			r = mid;
		} else {
			l = mid;
		}
	}

	ll res = n;
	vector<ll> v;
	for(ll i = l + 1; i >= 1; i--) {
		if(res >= i) {
			v.push_back(i);
			res -= i;
		}
	}

	reverse(v.begin(), v.end());
	rep(i, v.size()) {
		cout << v[i] << endl;
	}

	return 0;
}

Submission Info

Judge Result