C - Chip Factory

C - Chip Factory

Time Limit:9000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 5536

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   chips today, the  -th chip produced this day has a serial number  . 

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: 

which   are three  different integers between   and  . 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   indicating the total number of test cases. 

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

 
 
 
There are at most   testcases with 

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

#include <iostream>
#include<algorithm>
using namespace std;
int a[1010];
int main()
{
       int t;
       cin>>t;
       int n;
       while(t--)
       {
             cin>>n;
             for(int i=0;i<n;i++)
                cin>>a[i];
                int flag;
                int Max=0;
             for(int i=0;i<n-2;i++)
                for(int j=i+1;j<n-1;j++)
                  for(int k=j+1;k<n;k++)
             {
                    flag=max(max((a[i]+a[j])^a[k],(a[j]+a[k])^a[i]),(a[i]+a[k])^a[j]);
                    if(flag>Max)
                        Max=flag;
             }
             cout<<Max<<endl;
       }
    return 0;
}