Number of Co-Prime Pairs

CodeChefOpen on judge ↗

You are given an array of prime numbers P of size N and an integer M. Find number of unordered pairs of integers (A, B) such that: - 1 < A, B < M - A and B are coprime - A and B should not have any prime factor which is not in P ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - First line of each testcase contains two integers $N$, $M$ - Second line of

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