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
|
firefox_30:
2020-03-28 01:56:32
What are the compile options for Rust, particularly the optimization level? When will be the next update? |
|
zufius:
2020-03-20 04:36:04
time limit is 21s and I got AC in 0.00s. is it because the server is much stronger than 15 years ago ? or the test cases are too weak ? |
|
god_coder:
2019-11-23 18:23:10
Used Miller Rabbin. AC in one go :) |
|
jukerburg10:
2019-08-14 12:32:46
i used farmat little theorem in C ,,,getting WA ,,
|
|
akashbhalotia:
2019-07-06 14:13:20
#JavaCodersMatter :'( |
|
selfcoder24:
2019-06-11 09:03:13
Works with just fermant's with 20 iterations and by taking care of overflow during multiplications |
|
dkkv0000:
2019-05-18 11:08:42
useful links to solve the problem
|
|
abhinav_kr:
2019-05-14 09:00:56
Carmichael numbers may be giving you WA. Read this
|
|
exesharkx:
2019-02-10 14:57:27
For Overflow use boost library :) |
|
manjeet_:
2018-07-17 09:55:59
along with Fermat and Miller Rabin read this too , https://www.geeksforgeeks.org/multiply-large-integers-under-large-modulo/ |
| 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