//Michał Maciaszek
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
uintmax_t n = 0;
uintmax_t N = 0;
cin >> n >> N;
N = N%2;
n = pow(2, n);
uintmax_t* t = new uintmax_t[n];
for(intmax_t i = 0; i < n; ++i)
{
cin >> t[i];
}
for(intmax_t i = 0; i < N; ++i)
{
reverse(t, t+n);
}
for(intmax_t i = 0; i < n; ++i)
{
cout << t[i] << ' ' << flush;
}
cout << endl;
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 | //Michał Maciaszek #include <bits/stdc++.h> #include <unistd.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); uintmax_t n = 0; uintmax_t N = 0; cin >> n >> N; N = N%2; n = pow(2, n); uintmax_t* t = new uintmax_t[n]; for(intmax_t i = 0; i < n; ++i) { cin >> t[i]; } for(intmax_t i = 0; i < N; ++i) { reverse(t, t+n); } for(intmax_t i = 0; i < n; ++i) { cout << t[i] << ' ' << flush; } cout << endl; return 0; } |
English