Count Equal and Divisible Pairs in an Array LeetCode solution in Python

1
class Solution:
2
    def countPairs(self, nums: List[int], k: int) -> int:
3
        n = len(nums)
4
        c = 0
5
        for i in range(0, n):
6
            for j in range(i + 1, n):
7
                if nums[i] == nums[j] and ((i * j) % k == 0):
8
                    c += 1
9
        return c