Created
December 30, 2009 22:11
-
-
Save rcampbell/266447 to your computer and use it in GitHub Desktop.
Project Euler solutions in Haskell
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
| {- -} | |
| -- Problem 1 | |
| foldr (+) 0 (filter (\n -> mod n 3 == 0 || mod n 5 == 0) [1..1000]) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment