forked from MohmedIkram/Hacktoberfest2022
-
Notifications
You must be signed in to change notification settings - Fork 0
/
bitm6.cpp
37 lines (33 loc) · 689 Bytes
/
bitm6.cpp
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
#include<iostream>
using namespace std;
int setBit(int n,int pos) {
return ((n & (1<<pos))!=0);
}
void unique(int arr[],int n) {
int xorsum=0;
for(int i=0;i<n;i++) {
xorsum=xorsum^arr[i];
}
int tempxor=xorsum;
int setbit=0;
int pos=0;
while(setbit!=1) {
setbit=xorsum & 1;
pos++;
xorsum=xorsum>>1;
}
int newxor=0;
for(int i=0;i<n;i++) {
if(setBit(arr[i],pos-1)) {
newxor=newxor^arr[i];
}
}
int s=tempxor^newxor;
cout<<newxor<<endl;
cout<<s<<endl;
}
int main() {
int arr[]={1,2,3,1,2,3,5,7};
unique(arr,8);
return 0;
}