Submission #3907749

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> Pll;
typedef pair<P,P> PP;
#define rep(i,a,n) for(int i = a;i < n;i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9+7
#define sMOD 1e5
#define fs first
#define sc second


signed main(){
	
	ll n,temp = 1,temp2 = 0,ans = 0;
	cin >> n;
	ll memo[n] = {};
	
	rep(i,0,n){
		if(temp <= temp2){
			temp++;
			temp2 = 0;
			
		}
		memo[i] = temp;
		temp2++;
	}
	
	while(n > 0){
		cout << memo[n-1] << endl;
		n -= memo[n-1];
		
	}
	
	return 0;

}

Submission Info

Judge Result