2176. Count Equal ad DIvisible Pairs in an Array

Runtime   3 ms
Beats     100%


Memory    41.4 MB
Beats     74.80%


class Solution {
    public int countPairs(int[] nums, int k) {
        int ans=0;
        for(int i=0;i<nums.length;i++){
            for(int j=i+1;j<nums.length;j++){
                if(nums[i]!=nums[j])
                    continue;
                ans += (i*j)%k==0 ? 1:0;
            }
        }
        return ans;
    }
}