1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <bits/stdc++.h>

using namespace std;

const int N = 10000001;

int a[N];

int main() {
  int n, t;
  scanf("%d %d", &n, &t);
  int nn = 1 << n;
  for (int i = 0; i < nn; i++) {
    scanf("%d", a + i);
  }
  if (t % 2 != 0) {
    for (int i = 1; i < nn; i += 2) {
      swap(a[i - 1], a[i]);
    }
    if (n > 1) {
      for (int i = nn / 2; i < nn; i++) {
        printf("%d ", a[i]);
      }
      for (int i = 0; i < nn / 2; i++) {
        printf("%d ", a[i]);
      }
    } else {
      for (int i = 0; i < nn; i++) {
        printf("%d ", a[i]);
      }
    }
  } else {
    for (int i = 0; i < nn; i++) {
      printf("%d ", a[i]);
    }
  }
  return 0;
}