Skip to content
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

Added solution for Project Euler problem 72 #3122

Merged
merged 7 commits into from
Oct 16, 2020
Merged

Added solution for Project Euler problem 72 #3122

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
1bc9c58
Added solution for Project Euler problem 72. Fixes: #2695
fpringle Oct 9, 2020
b1d2b34
Update type annotations and 0-padding of directory name. Reference: #…
fpringle Oct 15, 2020
0118faa
Merge branch 'master' into problem_72
fpringle Oct 15, 2020
6d2846a
Rename sol1.py to sol2.py
fpringle Oct 15, 2020
3007bc4
Merge branch 'problem_72' of github.com:fpringle/Python into problem_72
fpringle Oct 15, 2020
cc76559
Added newline at the end of sol2.py
fpringle Oct 15, 2020
2a93dfb
Revert sol1.py
fpringle Oct 16, 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 type annotations and 0-padding of directory name. Reference: #… 
…3256
  • Loading branch information
@fpringle
fpringle committed Oct 15, 2020
commit b1d2b34dafc9a387c32509d48c82c73af0032c75
0 project_euler/problem_72/__init__.py → project_euler/problem_072/__init__.py
View file
Open in desktop
File renamed without changes.
6 changes: 4 additions & 2 deletions project_euler/problem_72/sol1.py → project_euler/problem_072/sol1.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,6 @@
"""
Project Euler Problem 72: https://projecteuler.net/problem=72

Consider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1,
it is called a reduced proper fraction.

Expand All @@ -15,7 +17,7 @@
"""


def solution(limit: int = 1000000):
def solution(limit: int = 1000000) -> int:
"""
Return the number of reduced proper fractions with denominator less than limit.
>>> solution(8)
Expand All @@ -40,4 +42,4 @@ def solution(limit: int = 1000000):


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