Submission #991914

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
#include <map>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define brep(i, n) for (int i = (int)n - 1; i >= 0; i--)
#define orep(i, n) for (int i =  1; i <= (int)n; i++)
#define vec vector
#define pb push_back
#define mp make_pair
#define pii pair<int, int>

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

	int left = 1;
	int right = n;
	while(1) {
		int mid = (left + right) / 2;
		if (mid * (mid + 1) / 2 < n) {
			left = mid + 1;
		} else right = mid;
		if (right == left) break;
	}
	while(1) {
		cout << left << endl;
		n -= left;
		if (n == 0) break;
		if (n < left) left = n;
		else left--;
	}
	return 0;
}

Submission Info

Judge Result