[Hdu 5536] [5acm/ICPC Changchun station in Asia] Chip Factory Question & Answer & code

[Hdu 5536] [5acm/ICPC Changchun station in Asia] Chip Factory Question & Answer & code

Question:
Given n numbers: s1, s2... Sn, obtain the largest (si + sj) ^ sk and satisfy (I! = J! = K ).
Question:
Obviously, a dictionary tree question inserts each number into the dictionary tree to enumerate the sum of two numbers. Considering that there may be duplicates, si and sj are first deleted from the dictionary tree each time I is enumerated, and then si + sj is queried.
Code:

#include
  
   #include#include
   
    #include
    
     using namespace std;int n,m,tot,T,cnt[70005];int tr[70005][2],s[1005];void init(int i){    tr[i][1]=tr[i][0]=0;    cnt[i]=0;}void add(int x,int id){    int now=0;    for (int i=31;i>=0;i--)    {        int p=0;        if (((1<
     
      =0;i--)    {        int p=1;        if (((1<