⚡100.00% ⚡ || ✅SUPER SIMPLE CODE 💌 || Easy to understand 🍨 || C++
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int numberOfPairs(vector<int>& nums1, vector<int>& nums2, int k) {
        int count = 0;
        for (int j = 0; j < nums2.size(); j++)
            for (int i = 0; i < nums1.size(); i++)
                if ((nums1[i] % (nums2[j] * k)) == 0)
                    count++;
        return count;
    }
};
```
['Array', 'Counting', 'C++']