PRIME OBSESSION

CodeChefOpen on judge ↗

Akash gave a number N and asked Rcc whether it is prime or not. Rcc is obsessed with prime so for small numbers (less than 100) he could answer the question. Now akash gave a number > 1000 and asked Rcc whether the number is prime or not. Input The first line of input contains an integer T, denoting the number of test cases. Then T test cases follow. - Each line of the test case contains a numb

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