Refactor problem 35
This commit is contained in:
parent
1d67f5c191
commit
ba97e04c9e
@ -31,10 +31,15 @@ def compute():
|
||||
"""
|
||||
circular_primes = []
|
||||
for i in range(2, 1_000_000):
|
||||
if is_prime(i):
|
||||
all_primes = True
|
||||
for j in circular_number(i):
|
||||
if not is_prime(j):
|
||||
all_primes = False
|
||||
break
|
||||
else:
|
||||
# else:
|
||||
# circular_primes.append(i)
|
||||
if all_primes:
|
||||
circular_primes.append(i)
|
||||
|
||||
return len(circular_primes)
|
||||
|
Loading…
x
Reference in New Issue
Block a user