Submission #991703

---

Source Code Expand

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

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

int main() {
	int N;
	cin >> N;
	int low = 0, high = N;
	while (high-low > 1) {
		const int med = (low+high)/2;
		ll tmp = (ll)(med) * (med-1)/2;
		if (tmp+med >= N) high = med;
		else low = med;
	}
	int rest = N;
	for (int i = high; i > 0; i--) {
		if (i <= rest) {
			cout << i << endl;
			rest -= i;
		}
	}
	return 0;
}

Submission Info

Judge Result