Project Euler: Problem92
力技でなんとかなる問題って気楽でいいわー。
import Data.Char step 1 = False step 89 = True step n = step $ sum $ map ((^2) . digitToInt) $ show n main = print $ length $ filter step [1..10000000]
./a.out 49.79s user 0.45s system 99% cpu 50.712 total