Java Solution with Simplest Apporoach
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public int countPairs(int[] nums, int k) {\n        int n = nums.length;\n        int count = 0;\n        for(int i = 0; i<n; i++){\n            int j = i+1;\n            while(j<n){\n                if(nums[i] == nums[j] && (i*j)%k == 0){\n                    count++;\n                }\n                j++;\n            }\n        }\n        return count;\n    }\n}\n```
['Java']