GoalScope — sieve_of_eratosthenes (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def sieve_of_eratosthenes(n):↵
"""Return a list of all prime numbers up to n."""↵
primes = [True] * (n + 1)↵
p = 2↵
while (p * p <= n):↵
if (primes[p] == True):↵
for i in range(p * p, n + 1, p):↵
primes[i] = False↵
p += 1↵
prime_numbers = [p for p in range(2, n + 1) if primes[p]]↵
return prime_numbers↵
</code>