Count Equal and Divisible Pairs in an Array

给一个数组, 求一个pair, nums[i] == nums[j] 并且 i * j 能被k整除.