stuff
This commit is contained in:
parent
f6620624df
commit
4f3056c84b
@ -1,5 +1,7 @@
|
||||
# Codewars solutions in python
|
||||
|
||||
![](https://www.codewars.com/users/thib8956/badges/small?theme=light)
|
||||
|
||||
## Quickstart
|
||||
|
||||
```console
|
||||
|
@ -1,5 +1,6 @@
|
||||
import numpy as np
|
||||
|
||||
|
||||
def sieve_np(limit):
|
||||
if limit < 2:
|
||||
return []
|
||||
@ -17,6 +18,7 @@ def sieve_np(limit):
|
||||
primes = np.where(is_prime)[0]
|
||||
return primes.tolist()
|
||||
|
||||
|
||||
def sieve(max_n):
|
||||
s = [True] * (max_n + 1)
|
||||
p = 2
|
||||
@ -30,28 +32,25 @@ def sieve(max_n):
|
||||
return primes
|
||||
|
||||
|
||||
def sieve_of_eratosthenes(limit):
|
||||
if limit < 2:
|
||||
return []
|
||||
|
||||
# Create a boolean array "prime[0..limit]" and initialize all entries as True
|
||||
prime = [True] * (limit + 1)
|
||||
prime[0] = prime[1] = False # 0 and 1 are not prime numbers
|
||||
|
||||
def sieve(max_n):
|
||||
s = [True] * (max_n + 1)
|
||||
p = 2
|
||||
while p**2 <= limit:
|
||||
if prime[p]:
|
||||
# Update all multiples of p starting from p^2
|
||||
prime[p**2 : limit + 1 : p] = [False] * len(prime[p**2 : limit + 1 : p])
|
||||
while p**2 <= max_n:
|
||||
if s[p]:
|
||||
for i in range(p**2, max_n + 1, p):
|
||||
s[i] = False
|
||||
p += 1
|
||||
|
||||
# Create a list of prime numbers
|
||||
primes = [p for p in range(2, limit + 1) if prime[p]]
|
||||
primes = [p for p in range(2, max_n + 1) if s[p]]
|
||||
return primes
|
||||
|
||||
|
||||
_primes = sieve(25_000_000)
|
||||
|
||||
|
||||
class Primes:
|
||||
primes = sieve(25_000_000)
|
||||
global _primes
|
||||
primes = _primes
|
||||
|
||||
@staticmethod
|
||||
def stream():
|
||||
|
Loading…
Reference in New Issue
Block a user