Submission #3168284

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
const int INF=1145141919,MOD=1e9+7;
const long long LINF=8101145141919364364;

int main(){
	int t; cin>>t;
	rep(q,t){
		int n,d; cin>>n>>d;
		priority_queue<int,vector<int>,greater<int>>  pq;
		pq.push(d);
		rep(i,n-1){
			int x=pq.top(); pq.pop();
			int y=127^x;
			pq.push(127);
			pq.push(y);
		}
		long long ans=0;
		while(pq.size()){ans+=pq.top();pq.pop();}
		cout<<ans<<endl;
	}
	return 0;
}

Submission Info

Judge Result