Submission #11609060

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;

ll gcd(ll a, ll b){return b!=0 ? gcd(b, a%b) : a;}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}

int main(){
	ll n;
	cin >> n;
	vector<ll> a(10000, 0);
	for(ll i = 1; i <= 10000; ++i){
		a[i-1] = i * (i + 1) / 2;
	}
	int ii = 0;
	for(int i = 0; i < 10000; ++i){
		if(n <= a[i]){
			ii = i+1;
            break;
		}
	}
	for(int i = ii; 0 < i; --i){
		if(0 <= n - i){
			cout << i << endl;
			n -= i;
			if(n == 0) return 0;
		}
	}
	return 0;
}

Submission Info

Judge Result