Anonymous user
Ascending primes: Difference between revisions
→Queue-based solution that does not need sorting.
Line 1,222:
if isprime(n):
primes.append(n)
queue.extend(n * 10 + k for k in range(n % 10 + 1, 10)
print(primes)</lang>
|