Created
September 28, 2011 09:37
-
-
Save ziotom78/1247484 to your computer and use it in GitHub Desktop.
Solution of Project Euler's Problem 34 (Haskell)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import Data.Char (digitToInt) | |
| main = print (sum ([x | x <- [10..100000], x == sum (map (\n -> product [1..n]) (map (digitToInt) (show x)))])) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment