My submission beat 100% of other submissions' runtime.
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 []
#include<unordered_map>
class Solution {
public:
    int numberOfPairs(vector<int>& nums1, vector<int>& nums2, int k) {
        unordered_map<int, int> keys;
        int count = 0;
        for(int i = 0;i<nums2.size();i++){
            keys[nums2[i]*k]+=1;
        }
        for(int i = 0; i<nums1.size();i++){
            for(const auto& [key, value]:keys){
                if(nums1[i]%key == 0)
                    count += value;
            }
        }
        return count;
    }
};
```
['Hash Table', 'C++']