Python3 solution:

def nonDivisibleSubset(k, s): # Write your code here ans = 0 if k == 1: return 1 else: remainder_list = [[0] for i in range(k)] for i in s: remain = i % k remainder_list[remain][0] += 1

    if remainder_list[0][0] != 0:
        ans += 1
    for i in range(1,k//2):
        ans += max(remainder_list[i][0], remainder_list[k-i][0])
    if k % 2:
        ans += max(remainder_list[k//2][0], remainder_list[k-k//2][0])
    else:
        if remainder_list[k//2][0] != 0:

            ans += 1
    return ans