Submission #5421720

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 2e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122

int main() {
    ll n;
    cin >> n;
    ll sum[n + 1] = {};
    rep(i, 1, n + 1) sum[i] = sum[i - 1] + i;
    set<int> ans;
    rep(i, 0, n + 1) {
        if (n <= sum[i]) {
            rep(j, 1, i + 1) {
                if (sum[i] - j != n) ans.insert(j);
            }
            break;
        }
    }

    for (auto i : ans) cout << i << endl;
    return 0;
}

Submission Info

Judge Result