[Hackerrank] Week1 - Divisible Sum Pairs

문제

코드

def divisibleSumPairs(n, k, ar):
    cnt = 0
    ar = list(combinations(ar, 2))
    for i in ar:
        if sum(i) % k == 0:
            cnt += 1
    return cnt코드를 입력하세요