Skip to content

Instantly share code, notes, and snippets.

@banacorn

banacorn/euler1.hs

Created May 5, 2012
Embed
What would you like to do?
Project Euler
sum [a | a <- [1..1000], mod a 3 == 0 && mod a 5 == 0]
maximum [ sum $ map Char.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