Submission #3700697

---

Source Code Expand

#include "bits/stdc++.h"
 
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++) 
#define REP(i,n) for(int i = 0;i < (n) ; i++) 
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2

using namespace std;

int MOD = 1000000007;

signed main(){
    int n;
    cin >> n;

    int max = 1;
    for(int i = 1;i <= n;i++){
        if(i*(i+1)/2 >= n){
            max = i;
            break;
        }
    }
    for(int i = 1; i <= max;i++){
        if(i != max*(max+1)/2 - n) cout << i << endl;
    }
    
    return 0;
}
// g++ -std=c++14 code1.cpp
// rm -r -f test;oj dl 

Submission Info

Judge Result