jlengrand/project_euler
1
0
Fork 0
mirror of https://github.com/jlengrand/project_euler.git synced 2026-03-10 08:41:20 +00:00
Code Issues Packages Projects Releases Wiki Activity

Solves problem 16

Browse Source 
Prepares problem 20
This commit is contained in:
Julien Lengrand-Lambert
2012-01-13 15:42:45 +01:00
parent afcf2ab0c5
commit 03a95ce587
2 changed files with 24 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
e_11.py → e_16.py
View File

@@ -4,7 +4,7 @@
# jlengrand
#Created on : Fri Jan 13 15:24:59 CET 2012
#
# DESCRIPTION : Solves problem 11 of Project Euler
# DESCRIPTION : Solves problem 16 of Project Euler
2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
What is the sum of the digits of the number 2^1000?
##---
@@ -13,8 +13,7 @@ def sum_power_2(value):
"""
Returns the sum of the digits of 2^value
"""
return 1
return sum([int(el) for el in list(str(pow(2, value)))])
if __name__ == '__main__':
print "Answer : %d" % (sum_power_2(1000))

22
e_20.py Executable file
View File

@@ -0,0 +1,22 @@
#!/usr/bin/env python
"""
##---
# jlengrand
#Created on : Fri Jan 13 15:41:12 CET 2012
#
# DESCRIPTION : Solves problem 20 of Project Euler
n! means n (n 1) ... 3 2 1
For example, 10! = 10 9 ... 3 2 1 = 3628800,
and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.
Find the sum of the digits in the number 100!
##---
"""
def sum_fact(value):
"""
Returns the sum of digits in value!
"""
return 1
if __name__ == '__main__':
print "Answer : %d" % (sum_fact)