-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathloops.py
137 lines (118 loc) · 1.9 KB
/
loops.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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
n = int(input())
'''
****
***
**
*
'''
# for i in range(1, n+1):
# for j in range( n-i+1):
# print('*', end="")
# print()
'''
# 1234
# 123
# 12
# 1
'''
# i = 1
# while i <= n:
# j = 1
# while j <= n-i+1:
# print(j, end="")
# j += 1
# i += 1
# print()
# i = 1
# while i <= n:
# j = 1
# while j <= i:
# print("#", end="")
# j += 1
# print()
# i += 1
'''
*
**
***
****
'''
# i = 1
# while i <= n:
# j = 1
# while (j <= n):
# if j <= n-i:
# print(" ", end="")
# else:
# print('*', end="")
# j += 1
# print()
# i += 1
'''
1
121
12321
1234321
'''
# i = 1
# mid = n+1//2
# while i <= n:
# count = 1
# j = 1
# while (j <= 2*n-1):
# if j <= n-i:
# print(" ", end="")
# else:
# print(count, end="")
# if j < mid:
# count += 1
# else:
# if count == 1:
# break
# count -= 1
# j += 1
# print()
# i += 1
# Prime Numbers
# flag = True
# if n == 1:
# print("Not Prime")
# for i in range(2, n):
# if n%i == 0:
# flag = False
# break
# if flag:
# print("Prime")
# else:
# print("Not Prime")
def isPrime(n):
if n <= 1:
print("Not Prime")
for i in range(2, n):
if n%i == 0:
break
else:
return True
return False
print(isPrime(n))
# Prime numbers from 2 to N
'''
1
232
34543
4567654
'''
# for i in range(1, n+1):
# count = i
# for j in range(1, 2*n):
# if j <= n-i:
# print(" ", end="")
# else:
# print(count, end="")
# if j < n:
# count += 1
# else:
# if i == count:
# break
# count -= 1
# print()