Submission #4799738

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl << endl;}
#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007

typedef long long ll;
typedef pair<ll,ll> P;

bool no[11111111];
int main(){
	cin.tie(0);ios::sync_with_stdio(false);
	ll n;cin >> n;
	ll sum = 0;
	REP(i, n){
		sum += i+1;
		no[i] = true;
		if(sum >= n)break;
	}
	REP(i, n){
		if(sum - (i+1) == n){
			sum -= i+1;
			no[i] = false;
		}
	}
	vector<int> ans;
	REP(i, n)if(no[i])cout << i+1 << endl;
	
	return 0;
}

Submission Info

Judge Result