Submission #5017273

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define sz(x) ((int)x.size())
#define sqr(x) ((x)*(x))
#define mem(a) memset(a,0,sizeof(a))
#define all(x) x.begin(),x.end()
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, int> pli;

const int mn = 3005;
const int mod = 1e9 + 7;
#define P mod

int n, m;

const string ss = "snuke";

int main() {
    //cin.sync_with_stdio(0);
#ifdef trote
    freopen("../1.txt", "r", stdin);
    freopen("../out.txt", "w", stdout);
#endif
    cin >> n;
    int ans = 1e9;
    int sum = 0;
    for (int i = 1; i <= n; i++) {
        if (1ll * i * (i + 1) / 2 >= n) {
            ans = i;
            break;
        }
    }
    vector<int> v;
    for(int i=ans;i;i--){
        if (i<=n) n-=i,v.pb(i);
    }
    reverse(all(v));
    for(auto &i:v) printf("%d\n",i);
    return 0;
}

Submission Info

Judge Result