Alien and Primes

CodeChefOpen on judge ↗

$Alien$ is a coder at $UIET$ $CODING$ $CLUB$ and he got a new problem on prime numbers. The problem states that given an integer $N$ find the prime number which at minimum distance to $N$ . If multiple answer is possible then output the smallest one of them . There are $T$ number of test cases. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Eac

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