Submission #7900239

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;

int main()
{
    int n, sum = 0, flag;
    cin >> n;
    rep(i, n)
    {
        sum += i + 1;
        if (sum >= n)
        {
            flag = i + 1;
            break;
        }
    }
    rep(i, flag)
    {
        if (sum - n == i + 1)
            ;
        else
            cout << i + 1 << endl;
    }
    return 0;
}

Submission Info

Judge Result