Sometimes you need to check pairs of elements against a simple rule, like whether their sum divides evenly by a number. The function divisible_sum_pairs receives a list ar and an integer k. Count the pairs of indices (i, j) where i < j and ar[i] + ar[j] is divisible by k with no remainder.

def divisible_sum_pairs(ar: list[int], k: int) -> int: