_3164.java

packagecom.fishercoder.solutions.fourththousand;

importjava.util.HashMap;
importjava.util.Map;

publicclass_3164 {
publicstaticclassSolution1 {
publiclongnumberOfPairs(int[] nums1, int[] nums2, intk) {
longcount = 0;
Map<Integer, Integer> map = newHashMap<>();
for (intnum : nums2) {
intproduct = num * k;
map.put(product, map.getOrDefault(product, 0) + 1);
 }
for (intnum : nums1) {
for (intj = 1; j * j <= num; j++) {
if (num % j == 0) {
if (map.containsKey(j)) {
count += map.get(j);
 }
intdivision = num / j;
if (j != division && map.containsKey(division)) {
count += map.get(division);
 }
 }
 }
 }
returncount;
 }
 }
}