K Divisible Elements Subarrays LeetCode solution in C++

1
class Solution {
2
 public:
3
  int countDistinct(vector<int> &nums, int k, int p) {
4
    int n = nums.size();
5
    set<vector<int>> ans;
6

7
    int i, j;
8
    for (i = 0; i < n; i++) {
9
      vector<int> tt;
10
      int ct = 0;
11
      for (j = i; j < n; j++) {
12
        tt.push_back(nums[j]);
13
        if (nums[j] % p == 0) ++ct;
14
        if (ct > k) break;
15
        ans.insert(tt);
16
      }
17
    }
18
    return ans.size();
19
  }
20
};