Submission #1195822

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;
typedef long long Int;

Int n;
Int pp = 1;
Int dp[210][210];

vector<Int> go(){
  vector<Int> res;
  Int k = 0;
  while((1LL << k) - 1 <= n)k++;
  Int p = 1;
  for(Int i = 0;i < k;i++)res.push_back(pp);pp++;
  n -= (1LL << (k-1)) - 1;
  for(Int i = k/2;i >= 0;i--){
    Int tmp = 0;
    for(Int j = 0;j <= k;j++){
      tmp += dp[i][j] * dp[k - i][j];
      if(tmp > n)break;
    }
    if(tmp > n)continue;;
    n -= tmp;
    res.insert(res.begin() + (p - 1), pp);
    res.insert(res.begin() + (i + p), pp);
    p++;
    pp++;
  }

  return res;
}

int main(){
  cin >> n;
  for(Int i = 0;i < 200;i++){
    for(Int j = 0;j < 200;j++){
      if(i < j)dp[i][j] = 0;
      else if(j == 0 || i == j)dp[i][j] = 1;
      else dp[i][j] = dp[i-1][j] + dp[i-1][j-1];
    }
  }

  vector<Int> res;
  
  while(n){
    vector<Int> tmp = go();
    res.insert(res.end(), tmp.begin(), tmp.end());
  }

  cout << res.size() << endl;
  for(Int i = 0;i < res.size();i++)cout << res[i] << " ";
  cout << endl;
  return 0;
}

Submission Info

Judge Result