hdoj5536Chip Factory

Chip Factory

Time Limit: 18000/9000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 979    Accepted Submission(s): 455

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
  
  

 

Source

2015ACM/ICPC亚洲区长春站-重现赛（感谢东北师大）

 

暴力写的，用g++提交过了。据说正解是字典树。

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<list>
#include<cmath>
using namespace std;
const int maxn=1010;
long long num[maxn];
int main()
{
	int n,i,j,k,t;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(i=0;i<n;++i){
			scanf("%lld",&num[i]);
		}
		long long ans=0;
		for(i=0;i<n;++i){
			for(j=0;j<i;++j){
				for(k=0;k<j;++k){
					ans=max(ans,(num[i]+num[j])^num[k]);
					ans=max(ans,(num[i]+num[k])^num[j]);
					ans=max(ans,(num[j]+num[k])^num[i]);
				}
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}