HDU5536 Chip Factory 被外表欺骗的水题 国庆咸鱼

Chip Factory

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

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亚洲区长春站-重现赛（感谢东北师大）

刚到3307就开了这题，异或啊。。。奇怪的表达式啊。。。。看了一会儿就感觉自己写不了，就去写别的题了。。。

后来zyyyyy告诉我说直接写三重循环就行了。。。

啥？

就又看题。。意思好像就是从题中给的数中找三个数让题目里面的那个表达式最大。。

三重循环的话。。难道直接暴力枚举？

居然真的是。。。。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
const int maxn=1010;
int save[maxn];
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int n,i,j;
        scanf("%d",&n);
        for(i=1;i<=n;i++){
            scanf("%d",&save[i]);
        }
        int result=0;
        int now;
        for(int i=1;i<=n;i++){
            for(int j=i+1;j<=n;j++){
                for(int k=j+1;k<=n;k++){
                    now=max((save[i]+save[j])^save[k],(save[i]+save[k])^save[j]);
                    now=max(now,(save[j]+save[k])^save[i]);
                    result=max(result,now);
                }
            }
        }
        printf("%d\n",result);
    }
    return 0;
}