mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-19 19:03:02 +08:00
Deal with maps (#1945)
* Deal with maps Try with the search term "pizza" to see why this was done in #1932 * fixup! Format Python code with psf/black push * Update armstrong_numbers.py * updating DIRECTORY.md * Update crawl_google_results.py Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
@ -5,6 +5,7 @@ Find the value of d < 1000 for which 1/d contains the longest recurring cycle
|
||||
in its decimal fraction part.
|
||||
"""
|
||||
|
||||
|
||||
def find_digit(numerator: int, digit: int) -> int:
|
||||
"""
|
||||
Considering any range can be provided,
|
||||
|
Reference in New Issue
Block a user