Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Prime Numbers :-> Sieve of Eratosthenes
#python 3.5.2 from time import time start = time() N = 999999 prime = [True for i in range(N+1)] p = 2 while (p * p <= N): if(prime[p] == True): for i in range(p*p,N+1,p): prime[i] = False p+=1 end = time() print("Total Time : ", end-start) for i in range(2,N+1): if(prime[i] == True): #print(i,end = " ") pass
run
|
edit
|
history
|
help
0
single_digit
inverse matrix gauss jordan
L5- part b
print
Ej2_python_204676887
Подсчет функции
oppo mobile
Generating subsets
no count xo
Operator overloading.py