Prime Check

CodeChefOpen on judge ↗

Given a number $N$. Find whether the given number is prime or not. ### Input - First line will contain $T$, number of testcases. - second line of each test case contains integer $N$. ### Output If the given number $N$ is Prime print "YES" ,else print "NO". ### Constraints - $1 \leq T \leq 100$ - $2 \leq M \leq 1000$ ### Subtasks - 30 points : $1 \leq R \leq 10000$ - 70 points : $1 \leq R \leq

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