[交流] Euler 工程 第三十题已有5人参与

from mytictoc import tic,toc

tic()

# find upper bound
n = 1
while n*(9**5)>10**(n+1)-1:
    n += 1

# compute
print reduce(lambda x,y:x+y,[n for n in xrange(2,n*(9**5)) if n==reduce(lambda x,y:x+y,[int(c)**5 for c in str(n)])])

toc()

443839
Elapsed time: 5.64833575 seconds

Originally posted by holmescn at 2011-06-18 18:00:12:
libralibra兄, reduce 比sum 要快吗?

================================
REDUCE+LAMBDA: 1000
499500
Elapsed time: 0.00649915 seconds

SUM: 1000
499500
Elapsed time: 0.00453717 seconds

================================
REDUCE+LAMBDA: 10000
49995000
Elapsed time: 0.00579124 seconds

SUM: 10000
49995000
Elapsed time: 0.00484922 seconds

================================
REDUCE+LAMBDA: 100000
4999950000
Elapsed time: 0.03130733 seconds

SUM: 100000
4999950000
Elapsed time: 0.00988506 seconds

================================
REDUCE+LAMBDA: 1000000
499999500000
Elapsed time: 0.34010105 seconds

SUM: 1000000
499999500000
Elapsed time: 0.13641119 seconds

================================
REDUCE+LAMBDA: 10000000
49999995000000
Elapsed time: 3.26226713 seconds

SUM: 10000000
49999995000000
Elapsed time: 1.39761869 seconds

from mytictoc import tic,toc


for i in xrange(3,8):
    print '================================'
    print 'REDUCE+LAMBDA: %d' % (10**i)
    tic()
    print reduce(lambda x,y:x+y,xrange(10**i))
    toc()

    print 'SUM: %d' % (10**i)
    tic()
    print sum(xrange(10**i))
    toc()