-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnonDivisibleSubset.py
More file actions
49 lines (35 loc) · 902 Bytes
/
nonDivisibleSubset.py
File metadata and controls
49 lines (35 loc) · 902 Bytes
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
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'nonDivisibleSubset' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
# 1. INTEGER k
# 2. INTEGER_ARRAY s
#
def nonDivisibleSubset(k, s):
r = [0] * k
for value in s:
r[value%k] += 1
result = 0
for a in range(1, (k+1)//2):
result += max(r[a], r[k-a])
if k % 2 == 0 and r[k//2]:
result += 1
if r[0]:
result += 1
return result
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
first_multiple_input = input().rstrip().split()
n = int(first_multiple_input[0])
k = int(first_multiple_input[1])
s = list(map(int, input().rstrip().split()))
result = nonDivisibleSubset(k, s)
fptr.write(str(result) + '\n')
fptr.close()