fork download
copy 
  1.  
  2.     #include <bits/stdc++.h>
  3.  
  4.     using namespace std;
  5.  
  6.     using ll = long long;
  7.     const int MOD = 1000000007; 
  8.     const int MOD2 =  998244353; 
  9.     const ll INF = 1e18;
  10.     const int MX = 1000001; //check the limits, dummy
  11.  
  12.  
  13.     ll modExp(ll base, ll power) {
  14.         if (power == 0) {
  15.             return 1;
  16.         } else {
  17.             ll cur = modExp(base, power / 2); cur = cur * cur; cur = cur % MOD;
  18.             if (power % 2 == 1) cur = cur * base;
  19.             cur = cur % MOD;
  20.             return cur;
  21.         }
  22.     }
  23.  
  24.     ll inv(ll base) {
  25.         return modExp(base, MOD-2);
  26.     }
  27.  
  28.  
  29.     ll mul(ll A, ll B) {
  30.         return (A*B)%MOD;
  31.     }
  32.  
  33.     ll add(ll A, ll B) {
  34.         return (A+B)%MOD;
  35.     }
  36.  
  37.     ll dvd(ll A, ll B) {
  38.         return mul(A, inv(B));
  39.     }
  40.  
  41.     ll sub(ll A, ll B) {
  42.         return (A-B+MOD)%MOD;
  43.     }
  44.  
  45.     ll* facs = new ll[MX];
  46.     ll* facInvs = new ll[MX];
  47.  
  48.     ll choose(ll a, ll b) {
  49.         if (b > a) return 0;
  50.         if (a < 0) return 0;
  51.         if (b < 0) return 0;
  52.         ll cur = facs[a];
  53.         cur = mul(cur, facInvs[b]);
  54.         cur = mul(cur, facInvs[a-b]);
  55.         return cur;
  56.     }
  57.  
  58.     // w
  59.     void initFacs() {
  60.         facs[0] = 1; 
  61.         facInvs[0] = 1;
  62.         for (int i = 1 ; i < MX ; i ++ ) {
  63.             facs[i] = (facs[i-1] * i) % MOD;
  64.             facInvs[i] = inv(facs[i]);
  65.         }
  66.     }
  67.  
  68.     // set wand permuatoin wrhow to wsee htis rand hwy does his wowr wke w
  69.     // which block is k in ?
  70.  
  71.     int main()  {
  72.         ios_base::sync_with_stdio(0); cin.tie(0);  
  73.  
  74.         int t;  cin >> t;
  75.         while (t --) {
  76.             ll n, k; cin >> n >> k;
  77.             ll max =  1 << (n - 1); 
  78.             vector<int> res(n);
  79.             if (k > max) {
  80.                 cout << -1 << '\n';
  81.             } else {
  82.                 int left = 0;
  83.                 int right = n - 1;
  84.                 for (int i = 1 ; i <=  n; i ++) {
  85.                     ll block = (1 << (n - 1));
  86.                     ll idx = k/block; 
  87.                     if (idx == 0 ) {
  88.                         res[left] = i;
  89.                         left ++; 
  90.                     } else {
  91.                         res[right] = i;
  92.                         right --;
  93.                     }
  94.                     k %= block;
  95.                 }
  96.  
  97.                 for (int i = 0 ; i  < n; i ++) {
  98.                     cout << res[i] << ' ';
  99.                 }
  100.                 cout << '\n'; 
  101.             }
  102.         }
  103.         // possible 
  104.         return 0;
  105.     }
  106.  
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
6
3 2
3 3
4 11
4 6
6 39
7 34
stdout
copy 
1 2 3 
1 2 3 
-1
1 2 3 4 
-1
1 2 3 4 5 6 7
https://ideone.com/gxhMdR
language:
C++ (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!