Easy Java Solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int countPairs(int[] nums, int k) {

        int count = 0;

        for(int i = 0;i<nums.length;i++){
            for(int j = i+1;j<nums.length;j++){

                if(nums[i] == nums[j] && (i*j)%k == 0) count++;
            }
        }

        return count;
    }
}
```
['Java']