Python解ProjectEuler最大回文数问题原题：A palindromic number reads the same both ways. The largest p
Python解ProjectEuler最大回文数问题
原题：
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99.
Find the largest palindrome made from the product of two 3-digit numbers.
===============================
Python代码
max(reduce(lambda a,b:a+b,[ [k*i for k in range(i,1000) if str(k*i)==str(k*i)[::-1]] for i in range(100,1000)]))
＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝
顺便贴个第二题的Haskell解，感觉上第二题Python就没办法OneLine了
----------------------------------------
原题：
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
----------------------------------------
暴力解：
sum $ filter even $ takeWhile (< 4000000) $ map fst $ iterate (\(a,b)->(b,a+b)) (1,2)
貌似其它语言在不import的情况下都不方便直接秒掉
http://www.jamcode.org/
后面的难的题目还没来得及用Python写了看
