Submission #991589

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int N; cin >> N;
	int lb = 0, ub = N + 1;
	vector<int> ans;
	while (ub - lb > 1) {
		int mid = (lb + ub) / 2;
		int x = N;
		vector<int> unko;
		for (int i = mid; i >= 1; i--)
			if (i <= x) {
				x -= i;
				unko.pb(i);
			}
		if (x) lb = mid;
		else {
			ub = mid;
			ans = unko;
		}
	}
	for (int i: ans) cout << i << endl;
}

Submission Info

Judge Result