We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 28dfdb6 commit c2223f5Copy full SHA for c2223f5
project_euler/problem_095/sol1.py
@@ -58,7 +58,7 @@ def generate_primes(num: int) -> list[int]:
58
are_primes[0] = are_primes[1] = False
59
for i in range(start=2, stop=isqrt(num) + 1):
60
if are_primes[i]:
61
- for j in range(start=i * i, stop=num + 1, step=i)
+ for j in range(start=i * i, stop=num + 1, step=i):
62
are_primes[j] = False
63
64
return [prime for prime, is_prime in enumerate(are_primes) if is_prime]
0 commit comments