VJ组队赛->Chip Factory（5536）

Problem Description

John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produces n chips today, the i -th chip produced this day has a serial number si .

At the end of the day, he packages all the chips produced this day, and send it to wholesalers. More specially, he writes a checksum number on the package, this checksum is defined as below:

maxi,j,k(si+sj)⊕sk

which i,j,k are three different integers between 1 and n . And ⊕ is symbol of bitwise XOR.

Can you help John calculate the checksum number of today?

Input

The first line of input contains an integer T indicating the total number of test cases.

The first line of each test case is an integer n , indicating the number of chips produced today. The next line has n integers s1,s2,..,sn , separated with single space, indicating serial number of each chip.

1≤T≤1000
3≤n≤1000
0≤si≤109
There are at most 10 testcases with n>100

Output

For each test case, please output an integer indicating the checksum number in a line.

 

Sample Input

  
  

   
   2
3
1 2 3
3
100 200 300
  
  

Sample Output

  
  

   
   6
400
  
  

题目大意：说了那么多废话，就是求max((a[i]+a[j])^a[k])，其中i,j,k都不相等
看到XOR这个运算符号，我直接是懵的，这是什么呀(@_@)，然后队长告诉我是位运算符异或^，不过我感觉题目有点模糊啊，那个max后面不应该加个括号么...
暴力解决吧，本来担心会超时，当我看到时间限制9s后就放心了，23333

#include <iostream>
#include <cstdio>

using namespace std;

const int N = 1e3 + 5;

int main()
{
	int a[N];
	int t,n;
	cin >> t;
	while(t--)
	{
		cin >> n;
		for(int i = 0; i < n; i++)
			scanf("%d",&a[i]);
		int i,j,k;
		int maxn = 0;
		for(i = 0; i < n-2; i++)
		{
			for(j = i+1; j < n-1; j++)
			{
				for(k = j+1; k < n; k++)
				{
					maxn = max(maxn,(a[j]+a[k])^a[i]);
					maxn = max(maxn,(a[i]+a[k])^a[j]);
					maxn = max(maxn,(a[i]+a[j])^a[k]);
				}
			}
		}
		cout << maxn << "\n";
	}
	return 0;
}