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 ab032d6 commit afb78f5Copy full SHA for afb78f5
project_euler/problem_095/sol1.py
@@ -101,7 +101,7 @@ def multiply(
101
else:
102
new_sum = sum_primes(primes_degrees=primes_degrees, num=num)
103
chain[num] = new_sum
104
- for prime_idx, prime in primes[min_prime_idx:]:
+ for prime_idx, prime in enumerate(primes[min_prime_idx:]):
105
num_n = prime * num
106
if num_n > max_num:
107
break
0 commit comments