/
xddxdd
/
Python
Обзор
Документация
Войти
/
xddxdd
/
Python
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
project_euler/problem_099/sol1.py
36 строк
1 KB
Joyce
[mypy] fix type annotations for all Project Euler problems (#4747)
11 окт 2021, 19:33
Не верифицирован
11 окт 2021, 19:33
bcfca67
Код
Авторство
О чём код?
""" 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())