NO_30Digit fifth powers

题目：

Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:

1634 = 1 ⁴ + 6 ⁴ + 3 ⁴ + 4 ⁴
8208 = 8 ⁴ + 2 ⁴ + 0 ⁴ + 8 ⁴
9474 = 9 ⁴ + 4 ⁴ + 7 ⁴ + 4 ⁴

As 1 = 1⁴ is not a sum it is not included.

The sum of these numbers is 1634 + 8208 + 9474 = 19316.

Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.

代码为：

import datetime

def ismatched(num):
    intlist=[int(i) for i in str(num)]
    if reduce(lambda x,y:x+y,[n**5 for n in intlist])==num:
        return True
    else:
        return False
start_time=datetime.datetime.now()
endnum=2
while 1:
    if 10**(endnum)>reduce(lambda x,y:x+y,[ 9**5 for x in xrange(endnum) ]):
        break
    else:
        endnum+=1
relist=[ x for x in xrange(10,10**(endnum)) if ismatched(x)]
print reduce(lambda  x,y:x+y,relist)
end_time=datetime.datetime.now()
print end_time-start_time

结果：
443839
0:00:05.580000

为什么这种代码居然比我还快呢？

import math,datetime



start_time=datetime.datetime.now()
def prob30(x):
        s = 0
        for i in range(2,1000000):
                t = 0
                for a in str(i):
                        t += int(a)**x
                if t == i:
                        s += t
        print s
prob30(5)
end_time=datetime.datetime.now()
#print abundantlist
print end_time-start_time

这个结果居然比我的快？：

443839
0:00:03.806000
牛人代码2：

import math,datetime



start_time=datetime.datetime.now()
c=0
for q in range (0,10):
  for w in range (0,q+1):
    for e in range (0,w+1):
      for r in range (0,e+1):
         for t in range (0,r+1):
            for y in range (0,t+1):
                v= (q**5+w**5+e**5+r**5+t**5+y**5)
                b=0
                n=str(v)
                m=0
                while m < len(n) and b <= v:
                       b+=int(n[m])**5
                       m+=1
                if b == v :
                      c += v
print c-1
end_time=datetime.datetime.now()
print end_time-start_time

结果为：

443839
0:00:00.030000
超NB