Easy Java solution
\nclass Solution {\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;
```\nclass Solution {\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) count++;\n      \n      }\n  }     \n        return count;\n    }\n}\n```
['Java']