Submission #992465

---

Source Code Expand

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

template<typename T>
void remove(std::vector<T>& vector, unsigned int index)
{
    vector.erase(vector.begin() + index);
}

int main() {
	vector<int> a;
	
	int n;
	cin >> n;
	int ans = 0;
	int now = 1;
	
	while(ans != n){
		if(ans < n){
			ans += now;
			a.push_back(now);
		}
		if(ans > n){
			remove(a, a.size() - 1);
			ans -= now;
			while(ans < n){
				bool flag = true;
				for(int i = 0; i < a.size() - 1; i++){
					if(a[i+1] - a[i] > 1){
						a[i]++;
						ans++;
						flag = false;
					}
					if(ans == n){
						break;
					}
				}
				if(flag){
					a[a.size() - 1]++;
					ans++;
				}
			}
		}
		now++;
	}
	
	for(int i = 0; i < a.size(); i++){
		cout << a[i] << endl;
	}
	
	return 0;
}

Submission Info

Judge Result