Sort 29 Discussions, By:
Please Login in order to post a comment
This problem can show you the true power of python :)
yes. really . so easy in python :)
perfect for python
my problem was, that 0! = 1, I thought it was 0...
Thank you! I missed that :-(
This is the first Euler+ problem that I feel is much easier than the original problem.
for i in range(10,n):
c=sum(a[j] for j in b)
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?