Skip to content

Added Problem 33 #1440

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.

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 5 commits into from
Oct 31, 2019
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
1 change: 1 addition & 0 deletions project_euler/problem_33/__init__.py
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@

55 changes: 55 additions & 0 deletions project_euler/problem_33/sol1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,55 @@
"""
Problem:

The fraction 49/98 is a curious fraction, as an inexperienced
mathematician in attempting to simplify it may incorrectly believe
that 49/98 = 4/8, which is correct, is obtained by cancelling the 9s.

We shall consider fractions like, 30/50 = 3/5, to be trivial examples.

There are exactly four non-trivial examples of this type of fraction,
less than one in value, and containing two digits in the numerator
and denominator.

If the product of these four fractions is given in its lowest common
terms, find the value of the denominator.
"""


def isDigitCancelling(num, den):
if num != den:
if num % 10 == den // 10:
if (num // 10) / (den % 10) == num / den:
return True


def solve(digit_len: int) -> str:
"""
>>> solve(2)
'16/64 , 19/95 , 26/65 , 49/98'
>>> solve(3)
'16/64 , 19/95 , 26/65 , 49/98'
>>> solve(4)
'16/64 , 19/95 , 26/65 , 49/98'
>>> solve(0)
''
>>> solve(5)
'16/64 , 19/95 , 26/65 , 49/98'
"""
solutions = []
den = 11
last_digit = int("1" + "0" * digit_len)
for num in range(den, last_digit):
while den <= 99:
if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
if isDigitCancelling(num, den):
solutions.append("{}/{}".format(num, den))
den += 1
num += 1
den = 10
solutions = " , ".join(solutions)
return solutions


if __name__ == "__main__":
print(solve(2))