Prime or Composite

CodeChefOpen on judge ↗

You are given $T$, test cases. For each case, you have to tell whether the number $n$ is prime or composite. ###Input: - The first line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single input of $n$. ###Output: For each test case, output "Prime" if the number is prime and "Composite" if the number is composite. ###Constraints - 1<=

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