#include <cstdio> #include <vector> #include <algorithm> #include <stack> using namespace std; vector<int> cards; int power2[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576}; int main(){ int n, t; scanf("%d%d", &n, &t); for(int i = 0; i < power2[n]; i++){ int a; scanf("%d", &a); cards.push_back(a); } if(t%2==1){ for(int i = 0; i < power2[n]; i+=2){ printf("%d %d ", cards[i+1], cards[i]); } } else{ for(int i = 0; i < power2[n]; i+=2){ printf("%d %d ", cards[i], cards[i+1]); } } }
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 | #include <cstdio> #include <vector> #include <algorithm> #include <stack> using namespace std; vector<int> cards; int power2[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576}; int main(){ int n, t; scanf("%d%d", &n, &t); for(int i = 0; i < power2[n]; i++){ int a; scanf("%d", &a); cards.push_back(a); } if(t%2==1){ for(int i = 0; i < power2[n]; i+=2){ printf("%d %d ", cards[i+1], cards[i]); } } else{ for(int i = 0; i < power2[n]; i+=2){ printf("%d %d ", cards[i], cards[i+1]); } } } |