Python Day 25: Running Time and Complexity
A prime is a natural number greater than 1 that has no positive divisors other than 1 and itself. Given a number, n, determine and print whether it's Prime or Not prime.
- # Enter your code here. Read input from STDIN. Print output to STDOUT
-
- from itertools import count, islice
-
- n = int(input())
- for i in range(n):
- x, prime = int(input()), True
- sq = int(x**0.5)-1
- if x<2: prime = False
- else:
- for num in islice(count(2), sq):
- if not x%num:
- prime = False
- print("Prime") if prime else print("Not prime")
Please click on the like button if it worked
