-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSalesByMatch.py
50 lines (38 loc) · 951 Bytes
/
SalesByMatch.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
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'sockMerchant' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER n
# 2. INTEGER_ARRAY ar
#
def sockMerchant(n, ar):
# Write your code here
arr_count = []
arr_unique = []
for i in range(n):
if ar[i] not in arr_unique:
arr_unique.append(ar[i])
arr_count.append(ar.count(ar[i]))
count = 0
final_arr = []
for i in arr_count:
# if i % 2 == 0:
count = i / 2
# print(count)
final_arr.append(int(count))
count = 0
return (sum(final_arr))
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
ar = list(map(int, input().rstrip().split()))
result = sockMerchant(n, ar)
fptr.write(str(result) + '\n')
fptr.close()