Skip to content

Solution for Euler Problem 26 #1939

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 9 commits into from
May 3, 2020
Merged
Prev Previous commit
Next Next commit
Update project_euler/problem_26/sol1.py
Co-authored-by: Christian Clauss <cclauss@me.com>
  • Loading branch information
shuklalok and cclauss authored May 3, 2020
commit 99013c5f1300fa0630c54f71c7daf67c86d26b05
2 changes: 1 addition & 1 deletion project_euler/problem_26/sol1.py
Original file line number Diff line number Diff line change
Expand Up @@ -32,7 +32,7 @@ def find_digit(numerator: int, digit: int) -> int:
the_digit = divide_by_number
else:
has_been_divided.append(now_divide)
now_divide = now_divide * 10 % divide_by_number
now_divide *= 10 % divide_by_number

return the_digit

Expand Down