Project euler solutions
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
JD Cantrell 98190625e7 Add a make clean rule 8 years ago
.gitignore Update ignores for program files 9 years ago
Makefile Add a make clean rule 8 years ago
README Added answers for problem 15 (in readme) and problem 16 9 years ago
big_int.c Correct multiplication of two digit numbers in big_int 9 years ago
big_int.h Correct multiplication of two digit numbers in big_int 9 years ago
euler1.c Convert clang, also clean up warnings 8 years ago
euler2.c Convert clang, also clean up warnings 8 years ago
euler3.c Convert clang, also clean up warnings 8 years ago
euler4.c Convert clang, also clean up warnings 8 years ago
euler5.c Convert clang, also clean up warnings 8 years ago
euler6.c Convert clang, also clean up warnings 8 years ago
euler7.c Convert clang, also clean up warnings 8 years ago
euler8.c Convert clang, also clean up warnings 8 years ago
euler9.c Convert clang, also clean up warnings 8 years ago
euler10.c Add solution to problem 10, also re-learned max/min integer representation 9 years ago
euler11.c Add solution for problem 11 9 years ago
euler12.c Added temporary answer for problem 12 9 years ago
euler13.c Added solution to problem 13 9 years ago
euler14.c Answer for problem 14 9 years ago
euler16.c Convert clang, also clean up warnings 8 years ago
euler17.c Convert clang, also clean up warnings 8 years ago
euler18.c Updated problem 18 with a final solution, will add triangle for problem 67, since this solution should work for much larger triangles (runs on O(n**2) time) 9 years ago
euler19.c Convert clang, also clean up warnings 8 years ago
euler20.c Added solution to problem 20, very straight forward once large numbers are handled correctly 9 years ago
euler21.c Added solution for problem 21 9 years ago
euler67.c Problem 67 is similar to problem 18, and also tests problem 18's solution on a larger data set 9 years ago

README

These programs were written on a 64-bit machine, and at this point in time
have no concern about being 32-bit or cross platform compatible.

To compile a solution:

gcc euler1.c -lm

Often times after solving a solution I will implement the discussed solution
just to see how it differsi with mine and to get a little bit of muscle
memory in case I see the problem again in some other situation.

Problem 15: is simple (2n choose n) for an n by n grid