[Python3] brute-force
Please pull this commit for solutions of weekly 72. \n\n\nclass Solution:\n    def countPairs(self, nums: List[int], k: int) -> int:\n        ans = 0 \n        
Please pull this [commit](https://github.com/gaosanyong/leetcode/commit/97dff55b43563450a33c98f2a216954117100dfe) for solutions of weekly 72. \n\n```\nclass Solution:\n    def countPairs(self, nums: List[int], k: int) -> int:\n        ans = 0 \n        for i in range(len(nums)): \n            for j in range(i+1, len(nums)): \n                if nums[i] == nums[j] and i*j % k == 0: ans += 1\n        return ans \n```
['Python3']