non-divisible-subset.py

#!/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):
    x = [0 for _ in range(k)]
    for ss in s:
        x[ss % k] += 1
    res = min(1, x[0])
    x = x[1:]
    for i in range(len(x) // 2):
        res += max(x[i], x[-(i+1)])
    if len(x) % 2 == 1:
        res += min(1, x[len(x) // 2])
    return res

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()