• + 0 comments

    Using Python


    from itertools import combinations
    
    def divisibleSumPairs(n, k, ar):
        pairs = list(combinations(ar, 2))
        return len([p for p in pairs if sum(p) % k == 0])