[SNIPPET-21] HackerRank - Divisible Sum Pairs

hackerrank_divisiblesumpairs.py

#!/bin/python3

import sys
import itertools

n,k = input().strip().split(' ')
n,k = [int(n),int(k)]
a = [int(a_temp) for a_temp in input().strip().split(' ')]

combinations = list(itertools.combinations(a, 2))

count = 0
for pair in combinations:
    sum_pair = int(pair[0] + pair[1])
    if sum_pair % k == 0:
        count += 1
print(count)