Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
~2668 Pime Numbers list
#~23999 max def prime(num): prnum = [] m = 2 x = 3 prnum.append(2) while x < num: if x % m == 0: if x == m: prnum.append(x) x = x + 1 m = 2 else: x = x + 1 m = 2 else: m = m + 1 return prnum practiceNum = int(input()) print(prime(practiceNum))
run
|
edit
|
history
|
help
2
gfg pattern
Factorial
(P3) Rok przestępny
benda x guna
Search for sum of pairs in given array
PyDIP
Prime numbers
Ns
Implement a stack by using an array
Принцип наименьшего времени Ферма