题解 | 树查找

//KY193 树查找
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
int n, k;
int main()
{
    while(cin>>n)
    {
        vector<int>a(n+1);
        for(int i=1;i<=n;i++) cin>>a[i];
        cin>>k;
        if((1<<(k-1))>n) cout<<"EMPTY\n";
        else{
            for(int i=(1<<(k-1));i<(1<<k)&&i<=n;i++){
                cout<<a[i]<<' ';
            }
            cout<<"\n";
        }
    }
    return 0;
}