Submission #1261824

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deque>

using namespace std;

#define mod 1000000007

long long int result[1001][128] = {};

long long int solve(int n, int d)
{
	if(result[n][d] > 0) return result[n][d];
	if(n == 1) return result[n][d] = d;
	for(int i = 0; i < 128; i++){
		result[n][d] = max(result[n][d], max(solve(n - 1, i) + (d ^ i), solve(n - 1, (d ^ i)) + i));
	}
	return result[n][d];
}

int main()
{
	int t;
	cin >> t;
	for(int i = 0; i < t; i++){
		int n, d;
		cin >> n >> d;
		cout << solve(n, d) << endl;
	}
	return 0;
}

Submission Info

Judge Result