The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even)
n → 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.
Which starting number, under one million, produces the longest chain?
NOTE: Once the chain starts the terms are allowed to go above one million.
-------------------------------------------------------------------------------------------------------------------------
#!/usr/bin/env python
#创建字典colenth
colenth
=
{
1
:
1
}
#起始数字为n时,对应的长度为collatz(n)
def
collatz(n):
#如果n这个key不在colenth字典中,则进行以下运算,否则直接返回colength[n]
if
not
colenth.get(n,
0
):
if
n
%
2
:
colenth[n]
=
collatz(
3
*
n
+
1
)
+
1
else
:
colenth[n]
=
collatz(n
/
2
)
+
1
return
colenth[n]
#字典key从1循环到999999,求得所有对应的value,取最大值。
m,n
=
0
,
0
for
i
in
xrange
(
1
,
1000000
):
c
=
collatz(i)
if
c > m:
m,n
=
c,i
print
m,n
比如在序列:
3→10→5→16→8→4→2→1
中,得到了比3大的多个数字的克拉茨序列长度,那么循环到这些数字时就无需再进行计算。
最后求这个字典中最大value对应的key就可以了。
为什么自己写的总是循环不出来。。。。