Count Equal and Divisible Pairs in an Array | JAVA
\n    public int countPairs(int[] nums, int k) {\n        int count = 0;\n        for(int i = 0; i<nums.length; i++){\n            for(int j = i+1; j<nums.lengt
```\n    public int countPairs(int[] nums, int k) {\n        int count = 0;\n        for(int i = 0; i<nums.length; i++){\n            for(int j = i+1; j<nums.length; j++){\n                if(nums[i] == nums[j] && (i*j)%k == 0){\n                    count++;\n                }\n            }\n        }\n        \n        return count;\n    }\n```
['Java']