SPOJ.com - Problem PON

PON - Prime or Not

#cryptography #prime-numbers-1 #primality-test

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

Submit solution!

hide comments

< Previous 3 4 5 6 7 8 9 10 11 12 13 Next >

	Nitto Janitto: 2014-08-05 17:57:40 Not sure if I understood it right, but it seems like the method to determine if a number is prime or not is random, so could it be possible to get WA once, but get AC the second time without changing anything in the code? Last edit: 2014-08-05 18:00:03
	Kapil Sethi: 2014-07-07 23:37:06 i used Miller algo and fast i/o but my time is 1.45 sec in c++.How can i further optimize to get better time? (like 0.0 :P)
	Alex Tran: 2014-06-30 03:53:46 my fermat primality implementation fails to recognize 32416187567 as prime..
	Ashwini: 2014-06-28 08:13:21 @Simarpreet You will need to write a new function for multiplication too apart from powering. Just think for a moment and you will get it.
	Ashwini: 2014-06-28 08:09:06 AC in one go.. I can't believe :) My first randomised algo program.. Last edit: 2014-06-28 08:09:47
	Soma: 2014-06-25 01:42:58 worth solving... my first problem solved using probabilistic method..../ learnt a lot..
	simararorarox9: 2014-06-22 04:13:54 it really works.. just one doubt, I did this program in python because.. In c++ it will get out of range when i find square using fast exponentiation method taking modulo at each step..How to avoid it. ? Last edit: 2014-06-22 04:14:38
	shashi roshan: 2014-05-26 19:01:35 fermat's test with 2 iteration is enough...dont forget to use long long / unsigned long long....test cases are weak..9223372036854775783 is prime, but my accepted solution shows it as not-prime...
	excursionist: 2014-05-20 22:19:42 TLE :( some suggestions plz my code is @ <snip> Last edit: 2022-11-21 12:34:43
	[Lakshman]: 2014-04-07 17:48:50 @Pratyush try to learn Rabin Miller.

Submit solution!

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