8000 Added solution for Project Euler problem 129. by fpringle · Pull Request #3113 · TheAlgorithms/Python · GitHub
[go: up one dir, main page]
Skip to content

Added solution for Project Euler problem 129. #3113

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 4 commits into from
Nov 21, 2020
Merged

Added solution for Project Euler problem 129. #3113

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
cac9e3d
Added solution for Project Euler problem 129. Fixes: #2695
fpringle Oct 9, 2020
8a4f1b3
Added doctest for solution() in project_euler/problem_129/sol1.py
fpringle Oct 10, 2020
a67afe7
Update formatting. Reference: #3256
fpringle Oct 15, 2020
997e2e7
More descriptive function and variable names, more doctests.
fpringle Oct 15, 2020
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
Prev Previous commit
Next Next commit
Update formatting. Reference: #3256
  • Loading branch information
@fpringle
fpringle committed Oct 15, 2020
commit a67afe7e326d1630b0cb69e3eb4c85acefa8e0dd
4 changes: 3 additions & 1 deletion project_euler/problem_129/sol1.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,6 @@
"""
Project Euler Problem 129: https://projecteuler.net/problem=129

A number consisting entirely of ones is called a repunit. We shall define R(k) to be
a repunit of length k; for example, R(6) = 111111.

Expand Down Expand Up @@ -45,4 +47,4 @@ def solution(limit: int = 1000000) -> int:


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