Skip to content

Performance: 80% faster Project Euler 145 #10445

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Oct 14, 2023
Merged

Performance: 80% faster Project Euler 145 #10445

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
0f75804
Performance: 80% faster Project Euler145
ManpreetXSingh Oct 14, 2023
bf77690
Added timeit benchmark
ManpreetXSingh Oct 14, 2023
c1dfb5a
>>> slow_solution() doctest
ManpreetXSingh Oct 14, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 7 additions & 0 deletions project_euler/problem_145/sol1.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -30,6 +30,10 @@ def reversible_numbers(
>>> reversible_numbers(3, 0, [0] * 3, 3)
100
"""
# There exist no reversible 1, 5, 9, 13 (ie. 4k+1) digit numbers
if (length - 1) % 4 == 0:
return 0

if remaining_length == 0:
if digits[0] == 0 or digits[-1] == 0:
return 0
Expand Down Expand Up @@ -94,3 +98,6 @@ def solution(max_power: int = 9) -> int:

if __name__ == "__main__":
print(f"{solution() = }")

# for i in range(1, 15):
# print(f"{i}. {reversible_numbers(i, 0, [0]*i, i)}")