-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathforloops2.py
56 lines (54 loc) · 944 Bytes
/
forloops2.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#1
'''n = int(input())
for i in range(0,n+1,1):
print(i)
#2
n = int(input())
for i in range(n+1):
print(i)
#3
n = int(input())
for i in range(1,n+1):
print(i)
#4
n = int(input())
for i in range(n,0,-1):
print(i)'''
#5 multiples of 3
'''a = int(input())
b = int(input())
for i in range(a,b+1,1):
if(i%3==0):
print(i)'''
# or from above
'''a = int(input())
b = int(input())
if(a%3==0):
s = a
elif(a%3==1):
s=a+2
elif(a%3==2):
s= a+1
for i in range(s, b+1,3):
print(i)'''
#prime or no slow
n = int(input())
flag = False
for d in range( 2, n, 1):
if n%d==0:
flag = True
if flag :
print("not prime no")
else :
print('prime')
# prime or no very fast
n = int(input())
flag = False
for d in range( 2, n, 1):
if n%d==0:
flag = True
break
if flag :
print("not prime no")
else :
print('prime')