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

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main(){
	int t;  cin >> t;
	
	while(t--){
		ll o,x,p;  cin >> o >> x >> p;
		ll num = 0;
		
		if(o == 1){
			num = x << p;
			cout << (0xFFF & num) << endl;
		}
		else if(o == 2){
			num = x >> p;
			cout << (num | (0xFFF << (12-p)) & 0xFFF) << endl;
		}
		else if(o == 3){
			ll a = 1 << p;
			cout << ((~a) & x) << endl;
		}
		else{
			ll a = 1 << p;
			cout << (a | x) << endl;
		}
	}
	
	return 0;
}