Submission #992123

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<ll> sum(n + 1, 0);
	for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + i;
	while (n != 0) {
		int Max = lower_bound(sum.begin(), sum.end(), n) - sum.begin();
		cout << Max << endl;
		n -= Max;
	}
	return 0;
}

Submission Info

Judge Result