First Question

CodeChefOpen on judge ↗

You are given 2 arrays of size N and M respectively and a number X you have to tell that how many pairs of array A[i] and B[j] exists such that product of them will the co-prime of X. Input: First Line contains 3 integers N,M,X next line will contain N space seperated Integers. next line will contain M space seperated Integers. Output: A single line no of such pairs. Constraints: SubTask 1

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI