Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- inline int powof2(int num)
- {
- int r=1;
- while(r*2<=num)
- r*=2;
- return r;
- }
- int main()
- {
- ios_base::sync_with_stdio(0);
- cin.tie(0); cout.tie(0);
- int n,k,m;
- cin>>n>>k>>m;
- vector<int> a(n);
- for(int &i:a) cin>>i;
- while(k)
- {
- int near=powof2(k);
- vector<int> ne;
- for(size_t i=0;i<a.size()-near;i++)
- {
- ne.emplace_back(a[i]^a[i+near]);
- }
- a=ne;
- k=k-near;
- }
- assert(m<(int)a.size());
- cout<<a[m]<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement