Problem hidden
PRIME2 - IS IT PRIME
Find whether the given Number is a PRIME NUMBER or NOT.
Input
First Line - T (Number of Test Cases) where 1<=T<=100
T lines follow:
Each Line has the NUMBER N (where 2<=N<=5000) to test for Primality.
Output
N lines - in Each line print "YES" (without the quotes) if N is prime,
"NO" if it is not.
Example
Input: 4
2
3
4
5 Output: YES
YES
NO
YES
Added by: | Arun Prakash |
Date: | 2013-01-15 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |