Submission #2633525

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#include <cassert>
#include <random>
#include <stack>
#include <ctime>
#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define REPI(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
using P = pair<long, long>;
using VI = vector<long>;

int main() {
    long n;
    cin >> n;
    long m = 1;
    for (; m * (m + 1) / 2 < n; m++);
    VI ans;
    long sum = 0;
    for (int i = 1; i <= m; i++) {
        if (i != m * (m + 1) / 2 - n) {
            ans.push_back(i);
            sum += i;
        }
    }
    assert(sum == n);
    for (auto a: ans) {
        cout << a << endl;
    }
}

Submission Info

Judge Result