Count pairs whose sum is divisible by a given number k

[Marcus-auz]

Given an array, you have to count the number of pairs whose sum is divisible by a user entered number k.Try to provide optimal solution.That works for large array input and other than the iterative approach if possible.