Find max range Primes

CodeChefOpen on judge ↗

Find two Prime Numbers which are at maximum distance in a given range. Input Input description Tips: - "The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. - Each test case contains two integers denoting the range. Output Output description. Tips: - "For each test case, output a single line containing two

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