Prime Numbers

CodeChefOpen on judge ↗

Given an integer N find whether it is a prime number or not. ### Input N - Single line integer ### Output Yes or No depending upon whether N is prime or not. ### Constraints 1 <= N <= 1000000000 ### Sample Test Cases **Sample 1** Input: ``` 2 ``` Output: ``` Yes ``` Explanation: 2 is a prime number

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