fork download
copy 
  1. # your code goes here
  2. def is_prime(x):
  3. 	if x == 1:
  4. 		return False
  5. 	i = 2
  6. 	while i*i <= x:
  7. 		if x % i == 0:
  8. 			return False
  9. 		i += 1
  10. 	return True
  11.  
  12. numtest = int(input())
  13. count = 1
  14. while count <= numtest:
  15. 	f1 = int(input())
  16. 	if is_prime(f1):
  17. 		print("Prime")
  18. 	else:
  19. 		print("Not Prime")
  20. 	count = count + 1
Success #stdin #stdout 0.01s 27664KB
comments (?)
stdin
copy 
3
123321
123
103
stdout
copy 
Not Prime
Not Prime
Prime
https://ideone.com/k4Qsfu
language:
Python 3 (python  3.9.5)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!