We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

# Project Euler #34: Digit factorials

# Project Euler #34: Digit factorials

Anachor + 2 comments This problem can show you the true power of python :)

coder_batman + 0 comments yes. really . so easy in python :)

dasnil500 + 0 comments perfect for python

coyote330 + 0 comments This is the first Euler+ problem that I feel is much easier than the original problem.

CALM_AND_CODE + 0 comments n=int(input())

# factorial from 0 to 9

a=[1,1,2,6,24,120,720,5040,40320,362880] sum1=0 for i in range(10,n): b=list(map(int,str(i))) c=sum(a[j] for j in b) if(c%i==0 ): sum1 +=i print(sum1)

mohibur_cou + 0 comments Find the sum of all numbers below N which divide the sum of the factorial of their digits. Is that mean all numbers from 1 to N-1?

Load more conversations

Sort 29 Discussions, By:

Please Login in order to post a comment