Submission #992808

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

//#define int long long
#define DEBUG 1
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) if(DEBUG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DEBUG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
using pii = pair<int, int>; using vi = vector<int>;
static const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
static const int MOD = (int)(1e9 + 7);

vector<int> a;
vector<int> ans;
void f(int x) {
	if (x == 0)return;
	int p = lower_bound(all(a), x) - a.begin();
	ans.emplace_back(p);
	f(x - p);
}

signed main() {
	int N; cin >> N;

	rep(i, 0, sqrt(N) * 2) {
		a.emplace_back(i*(i + 1) / 2);
	}
	f(N);
	dumpc(a);
	reverse(all(ans));
	dumpc(ans);
	rep(i, 0, ans.size()) {
		cout << ans[i] << endl;
	}
	return 0;
}

Submission Info

Judge Result