fuxino/project-euler-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix bug in sieve function

Browse Source
This commit is contained in:
daniele 2023-06-07 17:02:08 +02:00
parent aa57c9b5b2
commit ef2d0423c2
Signed by: fuxino
GPG Key ID: 981A2B2A3BBF5514
1 changed files with 1 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Python/projecteuler.py
View File

@ -77,13 +77,10 @@ def sieve(n):
# 0 and 1 are not prime, 2 and 3 are prime.
primes[0] = 0
primes[1] = 0
# primes[2] = 1
# primes[3] = 1
# Cross out (set to 0) all even numbers and set the odd numbers to 1 (possible prime).
for i in range(4, n - 1, 2):
for i in range(4, n, 2):
primes[i] = 0
# primes[i+1] = 1
# If i is prime, all multiples of i smaller than i*i have already been crossed out.
# if i=sqrt(n), all multiples of i up to n (the target) have been crossed out. So