题解 | #树查找#
树查找
https://www.nowcoder.com/practice/9a10d5e7d99c45e2a462644d46c428e4
#include <iostream> #include <cmath> using namespace std; int a[1010]; int main() { int n,d; cin>>n; for(int i=1; i<=n; i++){ cin>>a[i]; } cin>>d; int x = pow(2,d-1)-1; if(x < n){ int end = min(n, (int)(pow(2,d)-1)); for(int i=x+1; i<end; i++){ cout<<a[i]<<" "; } cout<<a[end]; } else{ cout<<"EMPTY"; } }