Submission #11608873

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define ll long long
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<long long>;
using vvll = vector<vll>;

vector<bool> count(ll n){
    ll x;
    ll i=1;
    if(n==1){
        return vector<bool>(1,true);
    }
    while(true){
        x=i*(i+1)/2;
        if(n<=x) break;
        i++;
    }
    vector<bool> ans(n,false);
    if(x==n){
        rep(j,i){
            ans.at(j)=1;
        }
        return ans;
    }
    vector<bool> ans2(x-n);
    ans2=count(x-n);
    rep(i,x-n){
        ans.at(i)=ans2.at(i);
    }
    rep(j,i){
        if(ans.at(j)==true) ans.at(j)=false;
        else ans.at(j)=true;
    }
    return ans;
}

int main() {
    ll n;
    cin>>n;
    vector<bool> ans(n);
    ans=count(n);
    rep(i,n){
        if(ans.at(i)==true) cout<<i+1<<endl;
    }
}

Submission Info

Judge Result