No_33:Digit factorials

145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.

Find the sum of all numbers which are equal to the sum of the factorial of their digits.

Note: as 1! = 1 and 2! = 2 are not sums they are not included.

思路。没点思路

代码:

import time
t=time.time()

facterlist=[[x,0] for x in range(10)]
for x in xrange(10):
    if x==0:
        facterlist[0]=1
    else:
        facterlist[x]=x*facterlist[x-1]

def iscurious2(n):
    success=True
    tempsum=sum([facterlist[int(x)] for x in str(n)])
    if tempsum!=n:
        success=False
    return success
maxnum=2540161
relist=[]
tempn=10

while tempn<=maxnum:
    if iscurious2(tempn):
        relist.append(tempn)
    tempn+=1
for item in relist:
    print item
print sum(relist)
print time.time()-t
运行结果为:
145
40585
40730
15.8159999847
,,
缺点:1.为什么maxnum=2540161呢?

2.好慢啊!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值