easy solution | beats 100%
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:O(n^2)\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```\nclass Solution {\npublic:\n    int countPairs(vector<int>& nums, int k) {\n        int count = 0 ;\n        for (int i=0; i<nums.size()-1; i++){\n            for (int j=i+1; j<nums.size(); j++){\n                if (nums[i]==nums[j]){\n                    if ((i*j) % k == 0){\n                        count++ ;\n                    }\n                }\n            }\n        }\n        return count ;\n    }\n};\n```
['Array', 'C++']