DESCRIPTION
These are solutions to Project Euler problems. It's easy to find solutions on the net, so if you don't want to spoil the fun, don't look at these.
Feel free to do WHATEVER with the code; I've added a license so anybody can go wild with it.
USAGE
Check which solutions have been provided by running:
make stats
Some problems require a pre-computed list of primes. You can download the list by running:
make primes
The default limit for primes is 10^8 but some problems do not require so many primes to be pre-computed.
Run particular solutions by descending into a language's subdirectory and
running make
For example, to run the solution for problem #25 in Racket, do
this:
cd racket
make 25
LANGUAGES
Racket is my preferred language and will have more problems solved in that language than any other. Racket is the only language that will consistently have explanations in source about what is happening.
- Bash: GNU bash, version 3.2.39(1)-release (i486-pc-linux-gnu)
- C: gcc (Debian 4.3.2-1.1) 4.3.2
- Clojure: Clojure 1.3.0
- Haskell: GHC 6.8.2
- J: 7.01b-7
- Java: Java(TM) SE Runtime Environment (build 1.6.0_20-b02)
- JavaScript: Spidermonkey 1.8.0 pre-release 1 2007-10-03
- Lua: 5.2.2
- Python: 2.7.3
- Racket: Racket 6.2
- Ruby: MRI 1.9.2
- Scala: Scala 2.9.1.r0-b20110831114755