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

Adopted new convention from template

Browse Source
This commit is contained in:
David Doblas Jiménez 2022-09-29 22:22:44 +02:00
parent 1abee1fe66
commit 314ed47f05
1 changed files with 10 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
src/Python/Problems001-050/Problem035.py
View File

@ -1,4 +1,4 @@
#!/usr/bin/env python3 #!/usr/bin/env python
""" """
Created on 02 Apr 2021 Created on 02 Apr 2021
@ -9,7 +9,8 @@ Solution for problem 35 of Project Euler
https://projecteuler.net/problem=35 https://projecteuler.net/problem=35
""" """
from utils import timeit, is_prime from utils import is_prime, timeit
def circular_number(n): def circular_number(n):
n = str(n) n = str(n)
@ -18,6 +19,7 @@ def circular_number(n):
result.append(int(n[i:] + n[:i])) result.append(int(n[i:] + n[:i]))
return result return result
@timeit("Problem 35") @timeit("Problem 35")
def compute(): def compute():
""" """
@ -29,7 +31,8 @@ def compute():
How many circular primes are there below one million? How many circular primes are there below one million?
""" """
circular_primes = []
ans = []
for i in range(2, 1_000_000): for i in range(2, 1_000_000):
if is_prime(i): if is_prime(i):
all_primes = True all_primes = True
@ -38,11 +41,11 @@ def compute():
all_primes = False all_primes = False
break break
if all_primes: if all_primes:
circular_primes.append(i) ans.append(i)
return len(circular_primes) return len(ans)
if __name__ == "__main__": if __name__ == "__main__":
print(f"Result for Problem 35: {compute()}") print(f"Result for Problem 35: {compute()}")