Submission #6157276

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
//priority_queue<int, vector<int>, greater<int> > pq;
#define _CRT_SECURE_NO_DEPRECATE
const int N = 30030;
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
const ll mod =  1e9+7;

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	ll n;
	cin>>n;
	int x=1;
	int y=-1;
	int z=1;
	while(z*(z+1)/2<n)
	{z++;
	}
	z--;
	x=n-z*(z+1)/2;
	if(x)
	{
		z++;
		y=z*(z+1)/2-n;
	}
	rep(i,1,z+1)
	{
		if(i!=y)
		cout<<i<<" ";
	}
}

Submission Info

Judge Result