Project Euler : Problem 36

dailycoding36.hs

-- Project Euler : Problem 36

binary :: Integer -> String
binary 0 = "0"
binary 1 = "1"
binary n = (binary $ fst div) ++ (show $ snd div)
    where div = n `divMod` 2

main = print $ sum [a | a <- [1..999999],
                    (show a) == (reverse $ show a),
                    (binary a) == (reverse $ binary a)
                   ]

-- 872187
-- ./dailycoding36  0.38s user 0.00s system 99% cpu 0.383 total