We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 25: Running Time and Complexity
  5. Discussions

Day 25: Running Time and Complexity

  • mayanksri461994
     + 0 comments
    # Enter your code here. Read input from STDIN. Print output to STDOUT
import math
T= int(input())
a=[]
for i in range(T):
    n=int(input())
    a.append(n)

for i in a:
    if i == 1:
        print('Not prime')
        continue
    
    s=int(math.sqrt(i))
    flag=0
    for j in range(2,max(2,s+1)):
        if i%j==0:
            flag=1
    print('Not prime' if flag ==1 else 'Prime')