daviddoji/project-euler
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Refactor problem 35

Browse Source
This commit is contained in:
David Doblas Jiménez 2021-09-02 16:24:28 +02:00
parent 1d67f5c191
commit ba97e04c9e
1 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/Python/Problem035.py
View File

@ -31,11 +31,16 @@ def compute():
""" """
circular_primes = [] circular_primes = []
for i in range(2, 1_000_000): for i in range(2, 1_000_000):
for j in circular_number(i): if is_prime(i):
if not is_prime(j): all_primes = True
break for j in circular_number(i):
else: if not is_prime(j):
circular_primes.append(i) all_primes = False
break
# else:
# circular_primes.append(i)
if all_primes:
circular_primes.append(i)
return len(circular_primes) return len(circular_primes)