euler34.py

# 145 является любопытным числом, поскольку 1! + 4! + 5! = 1 + 24 + 120 = 145.
# Найдите сумму всех чисел, каждое из которых равно сумме факториалов своих
# цифр. Примечание: поскольку 1! = 1 и 2! = 2 не являются суммами, учитывать
# их не следует.

from project_euler_defs import *

n = 10

# 1 вариант
start_time = datetime.now()
factorial_list = [factorial_self(_) for _ in range(n)]
curious_numbers = []
for i in range(3, n ** getpower(n, factorial_list)):
    number_list = [int(i) for i in list(str(i))]
    sum_number_list = sum(factorial_list[i] for i in number_list)
    if sum_number_list > i: continue
    elif sum_number_list == i: curious_numbers.append(i)
else:
    print(sum(curious_numbers))
print(datetime.now() - start_time)

# 2 вариант
start_time = datetime.now()
factorial_list = [factorial_self(_) for _ in range(n)]
sum_fact_not_0 = [sum(factorial_self(int(c)) 
                      for c in str(i)) for i in range(10 ** 4)]
sum_fact_0 = [sum(factorial_self(int(c)) 
                  for c in str(i).zfill(4)) for i in range(10 ** 4)]
print(sum([i for i in range(3, 10 ** getpower(n, factorial_list)) 
          if i == factorial_digit_sum(i, sum_fact_0, sum_fact_not_0)]))
print(datetime.now() - start_time)