#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <tuple>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int main() {
/*ifstream cin("input.txt");
ofstream cout("output.txt");*/
int n, t;
cin >> n >> t;
n = pow(2, n);
vector <int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
if (t % 2 == 1)
{
reverse(a.begin(), a.end());
}
for (int x : a)
{
cout << x << " ";
}
}
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 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 | #include <map> #include <set> #include <list> #include <cmath> #include <ctime> #include <deque> #include <queue> #include <stack> #include <string> #include <bitset> #include <cstdio> #include <limits> #include <vector> #include <climits> #include <cstring> #include <tuple> #include <cstdlib> #include <fstream> #include <numeric> #include <sstream> #include <iostream> #include <algorithm> #include <unordered_map> #include <unordered_set> using namespace std; int main() { /*ifstream cin("input.txt"); ofstream cout("output.txt");*/ int n, t; cin >> n >> t; n = pow(2, n); vector <int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } if (t % 2 == 1) { reverse(a.begin(), a.end()); } for (int x : a) { cout << x << " "; } } |
English