lkm/project-euler
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Problem 20 (and factorial util)

Browse Source
This commit is contained in:
Linus Miller 2018-03-29 11:56:40 +02:00
parent 9a33095ecc
commit 40158db6a1
2 changed files with 17 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
0020.py Normal file
View File

@ -0,0 +1,12 @@
from functools import reduce
import util
target = 648
result = util.factorial(100)
digits_sum = reduce(lambda x, y: x + y, map(lambda x: int(x), list(str(result))))
print(digits_sum)
print(digits_sum == target)

5
util.py
View File

@ -1,3 +1,5 @@
from functools import reduce
def find_largest_prime_factor(n): def find_largest_prime_factor(n):
prime_factor = 1 prime_factor = 1
factors.append(prime_factor) factors.append(prime_factor)
@ -34,3 +36,6 @@ def find_prime_factors(n):
factors.append(n) factors.append(n)
return factors return factors
def factorial(n):
return reduce(lambda x, y: x * y, range(1, n + 1))