Skip to content

Instantly share code, notes, and snippets.

@pknowledge
Created June 23, 2020 08:55
Show Gist options
  • Save pknowledge/df1c018167c2063fd8b8c468359ba027 to your computer and use it in GitHub Desktop.
Save pknowledge/df1c018167c2063fd8b8c468359ba027 to your computer and use it in GitHub Desktop.
Competitive Programming with Python | Bit Magic : Interconversion, Kth Bit, Single Number https://youtu.be/4-rgHbeqjTU
# n convert it into binary
def intToBin(n):
return str(bin(n))[2:]
# bin to int
def binToInt(s):
return int(s,2)
# kth bit set from right
def kthbit(n,k):
print(str(bin(n))[2:])
if n & (1 << (k-1)):
print("SET")
else:
print("NOT SET")
# [5,3,2,3,2,1,5]
# every number occurs twice
# we need to find the number which occurs only once
# n^n = 0
# n^0 = n
def findsingleoccur(arr):
res = arr[0]
for i in range(1,len(arr)):
res = res ^ arr[i]
return res
t = int(input())
while t:
arr = list(map(int,input().split()))
#binstring = intToBin(n)
#integer = binToInt(binstring)
#print(n,binstring,integer,n==integer)
#kthbit(n,k)
print(findsingleoccur(arr))
t=t-1
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment