estudo sobre propriedades da operacao XOR

Author: chrislucas

python/Xor/.idea/Xor.iml

@@ -0,0 +1,5 @@
+https://www.geeksforgeeks.org/given-a-set-find-xor-of-the-xors-of-all-subsets/
+https://www.geeksforgeeks.org/sum-xor-possible-subsets/
+https://www.geeksforgeeks.org/maximum-xor-using-k-numbers-1-n/
+https://www.geeksforgeeks.org/calculate-xor-1-n/
+http://codeforces.com/blog/entry/10229

python/Xor/.idea/misc.xml

@@ -0,0 +1,6 @@
+'''
+https://www.hackerrank.com/challenges/prime-xor/problem
+'''
+
+if __name__ == '__main__':
+    pass

python/Xor/.idea/modules.xml

@@ -0,0 +1,30 @@
+def isPowerOf2(n):
+    return (n & (n - 1)) == 0
+
+
+print([(isPowerOf2(i) and i > 1, i) for i in range(0, 100)])
+
+
+def sum_n_xor(n):
+    acc = 1
+    for x in range(2, n + 1):
+        acc = acc ^ x
+    return acc
+
+def sum_n_xor2(n):
+    o = n & 3
+    if o == 0:
+        return n
+    elif o == 1:
+        return 1
+    elif o == 2:
+        return n + 1
+    else:
+        return 0
+
+
+print([(x, sum_n_xor(x)) for x in range(4, 25)])
+print([(x, sum_n_xor2(x)) for x in range(4, 25)])
+
+if __name__ == '__main__':
+    pass