Submission #991542

---

Source Code Expand

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key

typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	ll n; cin>>n;
	ll sum=0;
	ll best=0;
	for(int i = 1; i <= n; i++)
	{
		sum+=i;
		best++;
		if(sum>=n) break;
	}
	sum=n;
	for(int i = best; i >= 1; i--)
	{
		if(sum>=i)
		{
			cout<<i<<'\n';
			sum-=i;
		}
	}	
}

Submission Info

Judge Result