Submission #991941

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n; cin >> n;
	
	int left = 0, right = n + 1;
	int mid;
	while (left < right){
		int n2 = n;
		bool flag = false;
		mid = (left + right) / 2;
		for (int i = mid; i > 0;i--){
			if (n2 > i){
				n2 -= i;
			}
			else if (n2 == i){
				flag = true;
				break;
			}
		}
		if (flag){
			right = mid;
		}
		else{
			left = mid + 1;
		}
	}

	vector<int>x;
	for (int i = left; i > 0; i--){
		if (n > i){
			n -= i;
			x.push_back(i);
		}
		else if (n== i){
			x.push_back(i);
			break;
		}
	}
	reverse(x.begin(), x.end());

	for (int i = 0; i < x.size(); i++){
		cout << x[i] << endl;
	}

	return 0;
}

Submission Info

Judge Result