skip to main | skip to sidebar

Project Euler

Sunday, September 14, 2008

Project Euler 20 sum of digits in 100!

[root@www ~]# python twenty.py
648
[root@www ~]# cat twenty.py
def factorial(n):
if n == 1:
return 1
else:
return n * factorial(n-1)

s = str(factorial(100))
l = [int(s[i]) for i in range(len(s))]
print sum(l)
Posted by JoBro Hater #3 at 9:12 PM

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Blog Archive

  • ▼  2008 (36)
    • ►  October (9)
    • ▼  September (17)
      • Project Euler Problem 26 repeating sequences
      • Project Euler Problem 25 Fibonacci number lengths
      • Project Euler Problem 24 Ordering Numbers Having N...
      • Project Euler Problem 23 Abundant Numbers
      • Project Euler Problem 22
      • Problem 21 Project Euler Amicable Numbers
      • Project Euler 20 sum of digits in 100!
      • 19 Euler first days of month = sundays.
      • Project Euler Problem 67 shortest path
      • Project Euler Problem 18 shortest path
      • Euler Project Problem 17 letter counts
      • Euler Project Problem 16
      • Euler Project Problem 15 factorial
      • Euler Project Problem Number 14
      • Euler Problem 13
      • Project Euler Problem 12 Triangular Numbers
      • Euler Problem 11 Diagonal multiplication
    • ►  August (10)

About Me

JoBro Hater #3
View my complete profile