def sockMerchant(n, arr):
unique_sock = set(arr)
result = 0
for i in unique_sock:
count = arr.count(i)
result += count // 2
return result
def main():
n = int(input())
arr = list(map(int, input().strip().split()))
result = sockMerchant(n, arr)
print(result)
if __name__ == '__main__':
main()
'HackerRank Algorithm' 카테고리의 다른 글
[HackerRank] 06. Min and Max (0) | 2020.03.09 |
---|---|
[HackerRank] 05. Mini-Max Sum (0) | 2020.03.09 |
[HackerRank] 04. Nested List (0) | 2020.03.09 |
[HackerRank] 02. Sum and Prod (0) | 2020.03.09 |
[HackerRank] 01. Time Conversion (0) | 2020.03.09 |
댓글