Simple ||  Java ||easy to understand || Beats 100%✅
Proof👇🏻https://leetcode.com/problems/find-the-number-of-good-pairs-i/submissions/1590830700Complexity
Time complexity:O(n)

Space complexity:O(1)
Code
# Proof👇🏻
https://leetcode.com/problems/find-the-number-of-good-pairs-i/submissions/1590830700

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

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

# Code
```java []
class Solution {
    public int numberOfPairs(int[] nums1, int[] nums2, int k) {
        int gp =0;
        for(int i=0; i<nums1.length; i++){
            for(int j=0; j<nums2.length; j++){
                if(nums1[i] % (nums2[j]*k)==0){
                    gp++;
                }
            }
        }
        return gp;
    }
}
```
['Java']