Count Equal and Divisible Pairs in an Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  int countPairs(vector<int> &nums, int k) {
4
    int count = 0;
5
    for (int i = 0; i < nums.size() - 1; i++) {
6
      for (int j = i + 1; j < nums.size(); j++)
7
        if (nums[i] == nums[j] && i * j % k == 0) {
8
          count++;
9
        }
10
    }
11
    return count;
12
  }
13
};