Submission #991814

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<LL,LL> PII;

int main() {
	LL N;
	cin >> N;
	/*
	LL left = 0, right = N;
	
	while(true) {
		
		
	}*/
	vector<int> ans;
	
	for(int i=0; i<N; i++) {
		if(i * (i + 1) / 2  >= N) {
			int cur = i;
			ans.push_back(cur);
			
			int remain = N - cur;
			for(int j=cur-1; j>=1; j--) {
				if(remain>=j) {
					ans.push_back(j);
					remain -= j;
				}
			}
			
			break;
		}
		
	}
	
	
	for(int i=0; i<ans.size(); i++) {
		cout << ans[i];
		if(i < ans.size()-1) cout << " ";
		else cout << endl;
	}
	
	
	return 0;
}

Submission Info

Judge Result