mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-21 02:30:15 +00:00
bcfca67faa
* [mypy] fix type annotations for problem003/sol1 and problem003/sol3 * [mypy] fix type annotations for project euler problem007/sol2 * [mypy] fix type annotations for project euler problem008/sol2 * [mypy] fix type annotations for project euler problem009/sol1 * [mypy] fix type annotations for project euler problem014/sol1 * [mypy] fix type annotations for project euler problem 025/sol2 * [mypy] fix type annotations for project euler problem026/sol1.py * [mypy] fix type annotations for project euler problem037/sol1 * [mypy] fix type annotations for project euler problem044/sol1 * [mypy] fix type annotations for project euler problem046/sol1 * [mypy] fix type annotations for project euler problem051/sol1 * [mypy] fix type annotations for project euler problem074/sol2 * [mypy] fix type annotations for project euler problem080/sol1 * [mypy] fix type annotations for project euler problem099/sol1 * [mypy] fix type annotations for project euler problem101/sol1 * [mypy] fix type annotations for project euler problem188/sol1 * [mypy] fix type annotations for project euler problem191/sol1 * [mypy] fix type annotations for project euler problem207/sol1 * [mypy] fix type annotations for project euler problem551/sol1
37 lines
1.0 KiB
Python
37 lines
1.0 KiB
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 solution(data_file: str = "base_exp.txt") -> int:
|
|
"""
|
|
>>> solution()
|
|
709
|
|
"""
|
|
largest: float = 0
|
|
result = 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:
|
|
largest = x * log10(a)
|
|
result = i + 1
|
|
return result
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution())
|