Created
August 18, 2013 10:08
-
-
Save reuk/6260885 to your computer and use it in GitHub Desktop.
One-liner solution to Project Euler problem 56.
This file contains 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 $ maximum [sum $ map digitToInt $ show (a ^ b) | a <- [1..100], b <- [1..100]] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment