Submission #1538651

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <time.h>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cassert>

using namespace std;

const int N = 50005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;

int n;
vector <int> g;

int main(){
    cin>>n;
    int x;
    for(int i=1;;i++){
        if((i * (i + 1)) / 2 >= n){
            x = i;
            break;
        }
    }
    for(int i=x;i>=1;i--){
        if(n >= i){
            n -= i;
            g.push_back(i);
        }
    }
    reverse(g.begin() , g.end());
    for(int i=0;i<(int)g.size();i++) cout<<g[i]<<endl;
    return 0;
}

Submission Info

Judge Result