Project Euler

12>求数列,形式为

 1: 1
 3: 1,3
 6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28

即每列的最后数字为1+2+...,其他的数字为其因子

要求第一个有超过100个因子的数

import math def getNumber(index): return sum(range(1,index+1)) def getFactors(number): begin=1 result=[] while begin<=math.sqrt(number): if number%begin==0: result.append(begin) result.append(number/begin) begin+=1 return result lastIndex=2 while 1: number=getNumber(lastIndex) factors=getFactors(number) l_factors=len(factors) if l_factors>499: print lastIndex,factors,l_factors break print lastIndex,l_factors lastIndex+=1

14>按照如下方式操作数字,例如

n->n/2    当n为偶数时

n->3n+1 当n为奇数时

对13而言,其对应的数列为13 40 20 10 5 16 8 4 2 1

其长度为10.

求出1000000以下的数字中哪个数字产生的数列长度最长.

def getNextNumber(number): if number%2==0: return number/2 else: return number*3+1 def getArray(number): result=[] while 1: result.append(number) number=getNextNumber(number) if number==1: result.append(number) break return result lastNumber=2 maxLength=(lastNumber,0) while lastNumber<1000000: array=getArray(lastNumber) if len(array)>maxLength[1]: maxLength=(lastNumber,len(array)) lastNumber+=1 print lastNumber,maxLength