PON - Prime or Not
Given the number, you are to answer the question: "Is it prime?"
Solutions to this problem can be submitted in C, C++, Pascal, Perl, Python, Ruby, Lisp, Hask, Ocaml, Prolog, Whitespace, Brainf**k and Intercal only.
Input
t – the number of test cases, then t test cases follows. [t <= 500]
Each line contains one integer: N [2 <= N <= 2^63-1]
Output
For each test case output string "YES" if given number is prime and "NO" otherwise.
Example
Input: 5 2 3 4 5 6 Output: YES YES NO YES NO
hide comments
knb_dtu:
2013-11-23 15:12:16
Miller Rabin
|
|
Wei Qiu:
2013-11-06 23:02:24
Hi,all
|
|
AlcatraZ:
2013-10-23 20:52:39
Nice problem.. Learned something new.
|
|
P_Quantum:
2013-09-22 17:16:30
Nice one..!! Learned a lot..:) |
|
The Terminator:
2013-08-26 16:13:37
acc in little fermat
|
|
Dragan MarkoviƦ:
2013-08-16 20:21:00
Fermat's primality test is awesome. |
|
Lakshay Singhal:
2013-08-15 17:00:21
gr8 question...learnt smthng new
|
|
Bharath Reddy:
2013-06-17 09:13:33
1 iteration Miller Rabin enough..
|
|
Himanshu:
2013-06-02 16:16:02
really very good question learn a lot....
|
|
Chandan Mittal:
2013-05-19 20:26:17
using MR test..
|
Added by: | Roman Sol |
Date: | 2005-01-24 |
Time limit: | 21s |
Source limit: | 5000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ADA95 ASM32 BASH CSHARP CLPS D ERL FORTRAN ICON JAVA JS-RHINO LUA NEM NICE PHP PIKE ST |
Resource: | ZCon 2005 |