Solutions to the Project Euler problems in various programming languages.

Unless noted otherwise in the language sections, every solution should be:

• General - supports calculations for an arbitrary input parameter
• Fast - when possible, does not resort to brute force techniques
• Self-contained - no 3rd party or non-standard library usage
• Clear - employs good software engineering practices and language idioms

• C - 170 problems
• Python - 1 problem

You can generate a simple performance comparison report of the used languages by running:

./performance_report.sh

The script will print the number of executed solutions and their total running time for each language.

An example of a barebones, compiled, procedural language approach.

Build by running make from the top of the c/ directory tree

make build      // default, compiles all binaries
make all        // compiles binaries and also runs tests
make tests      // runs all tests
make debug      // compiles all binaries with debugging information
make verify     // performs dynamic verification using the valgrind's memcheck tool
make clean      // deletes compilation related generated files
make distclean  // deletes all generated files
make tags       // creates a single ctags database with symbol lookups

Does not check for numeric overflows, consequently a number of the solutions will produce incorrect answers for very large input parameters

An example of a rich-featured, interpreted, object-oriented language approach.

The top of the python/ directory tree should be in PYTHONPATH

make tests      // runs all tests
make verify     // pylint the source code
make clean      // deletes compilation related generated files
make distclean  // deletes all generated files
make tags       // creates a single ctags database with symbol lookups