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
|
rohit9934:
2017-05-08 16:02:07
The only thing that can screw you up is overflow WA |
|
caohoangtung:
2017-04-01 19:50:06
First time using Miller Rabin :D learnt alot |
|
nilabja16180:
2017-03-25 15:41:52
20 iteration gives 0.15 sec, 100 iteration produces result in 0.74 sec, 1000 iteration produces result in 7.84 sec! |
|
epsilonalpha:
2017-03-14 20:49:32
0.05s with 7-base deterministic Miller Rabin and 0.09s with 12-base deterministic Miller Rabin in C++. :) |
|
thinkwise:
2017-02-22 17:52:36
Ohh man why i am getting tle man
|
|
cake_is_a_lie:
2017-02-22 01:11:21
@rishi_devan: We do have a deterministic primality test; google AKS primality test.
|
|
malavan:
2017-01-10 15:58:03
Why wrong answer in Miller :( |
|
scorpion_ajay:
2017-01-07 14:24:36
good question, ac in one go, 20 iterations is a good choice for almost all integers
|
|
swatantragupta:
2016-12-23 12:38:13
nice question...miller rabin works fine ..take care of overflow while multiplication.. |
|
Abhishek:
2016-09-24 18:33:02
Solved with 4 iterations of fermat's |
| 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 |
RSS