-
Notifications
You must be signed in to change notification settings - Fork 2
/
Maximum Subset XOR.cc
77 lines (50 loc) · 1.04 KB
/
Maximum Subset XOR.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
//{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// Function to return maximum XOR subset in set[]
class Solution
{
public:
int maxSubsetXOR(int arr[], int N)
{
//Your code here
if(N == 0) return 0;
int num = 0;
while(true)
{
//first find max element
int maxi = INT_MIN;
for(int i=0;i<N;i++){
if(maxi<arr[i])
maxi=arr[i];
}
if(maxi == 0)
return num;
num = max(num,num^maxi);
for(int i=0;i<N;i++)
{
arr[i] = min(arr[i],arr[i]^maxi);
}
}
}
};
//{ Driver Code Starts.
int main()
{
int t,n,a[100004],k;
scanf("%d",&t);
while(t--)
{
//cin>>n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
Solution obj;
printf("%d\n",obj.maxSubsetXOR(a,n));
// cout<<bin(a,0,n-1,k)<<endl;
}
}
// } Driver Code Ends