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

#include <bitset>
#include <iostream>
using namespace std;

int main() {
    int t,o,x,p;
    cin>>t;
    while(t--){
        cin>>o>>x>>p;
        bitset<12> bit(x);
        switch (o) {
            case 1:
                bit<<=p;
                break;
            case 2:
                bit>>=p;
                for(int i=11;i>11-p;i--) bit.set(i,true);
                break;
            case 3:
                bit.set(p,false);
                break;
            case 4:
                bit.set(p,true);
        }
        cout<<bit.to_ulong()<<"\n";
    }
}