#include <stdio.h> #include <algorithm> using namespace std; int A[3000000]; int main() { int n, t; scanf("%d %d", &n, &t); int i2n = 1<<n; for (int i=0; i<i2n; ++i) { scanf("%d", &A[i]); } if ((t&1) == 1) { for (int i=i2n-1; i>=0; --i) { printf("%d ", A[i]); } } else { for (int i=0; i<i2n; ++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 | #include <stdio.h> #include <algorithm> using namespace std; int A[3000000]; int main() { int n, t; scanf("%d %d", &n, &t); int i2n = 1<<n; for (int i=0; i<i2n; ++i) { scanf("%d", &A[i]); } if ((t&1) == 1) { for (int i=i2n-1; i>=0; --i) { printf("%d ", A[i]); } } else { for (int i=0; i<i2n; ++i) { printf("%d ", A[i]); } } return 0; } |