Submission #5678165

---

Source Code Expand

#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <map>

using namespace std;
typedef long long ll;
using P = pair<ll,ll>;

int main() {
    ll N;
    cin >> N;
    for(ll i=0;i<=N;i++){
        ll tmp = (i+1)*i/2;
        if(tmp-N<i && tmp-N>=0){
            for(int j=1;j<=i;j++){
                if(j==tmp-N)continue;
                else cout << j << endl;
            }
            return 0;
        } 
    }
}

Submission Info

Judge Result