Submission #7954949

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int sum = (1LL+i)*i/2;
    if (sum >= n) {
      int remove = sum-n;
      for (int j = 1; j <= i; j++) {
        if (j != remove)
          cout << j << endl;
      }
      return 0;
    }
  }
}

Submission Info

Judge Result