#include <cstdio> #include <vector> #include <map> using namespace std; int n, t; int a[1048666]; int main() { scanf("%d%d", &n, &t); int n2 = 1 << n; for (int i = 0; i < n2; ++i) { scanf("%d", &a[i]); } if (t % 2 == 1) { for (int i = 0; i < n2; ++i) { printf("%d ", a[n2 - i -1]); } } else { for (int i = 0; i < n2; ++i) { printf("%d ", a[i]); } } return 0; }
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 <cstdio> #include <vector> #include <map> using namespace std; int n, t; int a[1048666]; int main() { scanf("%d%d", &n, &t); int n2 = 1 << n; for (int i = 0; i < n2; ++i) { scanf("%d", &a[i]); } if (t % 2 == 1) { for (int i = 0; i < n2; ++i) { printf("%d ", a[n2 - i -1]); } } else { for (int i = 0; i < n2; ++i) { printf("%d ", a[i]); } } return 0; } |