题解 | 【模板】位运算Ⅲ ‖ 混合运算

#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using PII=pair<ll,ll>;
using PIII=pair<int,pair<int,int>>;
const ld ESP = 1e-10;
const ld PI = acosl(-1);
const int N=1e5+10;
const int M=2e5+10;
// const int mod = 1000000007;
const int mod = 998244353;
//随机化
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<> dis(1, 1000000000);
// cout<<fixed<<setprecision(10);
void solve(){
    int op,x,p;
    cin>>op>>x>>p;
    if(op==1){
        cout<<(x<<p)%(1<<12)<<'\n';
    }else if(op==2){
        int t=0;
        for(int i=11;i>11-p;i--){
            t|=(1<<i);
        }
        cout<<((x>>p)|t)<<'\n';
    }else if(op==3){
        if(x>>p&1)cout<<(x^(1<<p))<<'\n';
        else cout<<x<<'\n';
    }else{
        if(x>>p&1) cout<<x<<'\n';
        else cout<<(x^(1<<p))<<'\n';
    }


}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _=1;
    cin>>_;
    while(_--){
        solve();
    }
    return 0;
}