mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
6acd7fb5ce
* Wrap lines that go beyond GiHub Editor
* flake8 --count --select=E501 --max-line-length=127
* updating DIRECTORY.md
* Update strassen_matrix_multiplication.py
* fixup! Format Python code with psf/black push
* Update decision_tree.py
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
35 lines
1012 B
Python
35 lines
1012 B
Python
"""
|
|
Problem:
|
|
|
|
Comparing two numbers written in index form like 2'11 and 3'7 is not difficult, as any
|
|
calculator would confirm that 2^11 = 2048 < 3^7 = 2187.
|
|
|
|
However, confirming that 632382^518061 > 519432^525806 would be much more difficult, as
|
|
both numbers contain over three million digits.
|
|
|
|
Using base_exp.txt, a 22K text file containing one thousand lines with a base/exponent
|
|
pair on each line, determine which line number has the greatest numerical value.
|
|
|
|
NOTE: The first two lines in the file represent the numbers in the example given above.
|
|
"""
|
|
|
|
import os
|
|
from math import log10
|
|
|
|
|
|
def find_largest(data_file: str = "base_exp.txt") -> int:
|
|
"""
|
|
>>> find_largest()
|
|
709
|
|
"""
|
|
largest = [0, 0]
|
|
for i, line in enumerate(open(os.path.join(os.path.dirname(__file__), data_file))):
|
|
a, x = list(map(int, line.split(",")))
|
|
if x * log10(a) > largest[0]:
|
|
largest = [x * log10(a), i + 1]
|
|
return largest[1]
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(find_largest())
|