count-equal-and-divisible-pairs-in-an-array.cpp

class Solution {
public:
    int countPairs(vector<int>& nums, int k) {
        
        int count = 0;

        for( int i = 0 ; i < nums.size()-1 ; i++ ){

            for( int j  = i+1 ; j < nums.size() ; j++ ){

                if ( ( ( i * j ) % k == 0 ) && ( nums[i] == nums[j]) ){
                    count++; 
                }
            }
        }

        return count;
    }
};