-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsansa_and_xor.py
57 lines (43 loc) · 1.11 KB
/
sansa_and_xor.py
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
#https://www.hackerrank.com/challenges/sansa-and-xor/problem?isFullScreen=true
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'sansaXor' function below.
#
# The function is expected to return an INTEGER.
# The function accepts INTEGER_ARRAY arr as parameter.
def sansaXor(arr):
# Write your code here
# [1, 2, 3, 4]
# 1, 2, 3, 4
# (1, 2), (2, 3), (3, 4)
# (1, 2, 3), (2, 3, 4)
# (1, 2, 3, 4)
# 1, 2, 3, 4, 5
# (1, 2), (2, 3), (3, 4), (4, 5)
# (1, 2, 3), (2, 3, 4), (3, 4, 5)
# (1, 2, 3, 4), (2, 3, 4, 5)
# (1, 2, 3, 4, 5)
# Number of occurences of values at even index is odd
lenA = len(arr)
if lenA % 2 == 0:
return 0
i = 0
res = 0
while i < lenA:
res ^= arr[i]
i += 2
return res
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
t = int(input().strip())
for t_itr in range(t):
n = int(input().strip())
arr = list(map(int, input().rstrip().split()))
result = sansaXor(arr)
fptr.write(str(result) + '\n')
fptr.close()