1
0
Fork 0
Project euler solutions
Du kannst nicht mehr als 25 Themen auswählen Themen müssen entweder mit einem Buchstaben oder einer Ziffer beginnen. Sie können Bindestriche („-“) enthalten und bis zu 35 Zeichen lang sein.
 
 
JD Cantrell 98190625e7
Add a make clean rule
vor 13 Jahren
.gitignore Update ignores for program files vor 14 Jahren
Makefile Add a make clean rule vor 13 Jahren
README Added answers for problem 15 (in readme) and problem 16 vor 13 Jahren
big_int.c Correct multiplication of two digit numbers in big_int vor 13 Jahren
big_int.h Correct multiplication of two digit numbers in big_int vor 13 Jahren
euler1.c Convert clang, also clean up warnings vor 13 Jahren
euler2.c Convert clang, also clean up warnings vor 13 Jahren
euler3.c Convert clang, also clean up warnings vor 13 Jahren
euler4.c Convert clang, also clean up warnings vor 13 Jahren
euler5.c Convert clang, also clean up warnings vor 13 Jahren
euler6.c Convert clang, also clean up warnings vor 13 Jahren
euler7.c Convert clang, also clean up warnings vor 13 Jahren
euler8.c Convert clang, also clean up warnings vor 13 Jahren
euler9.c Convert clang, also clean up warnings vor 13 Jahren
euler10.c Add solution to problem 10, also re-learned max/min integer representation vor 14 Jahren
euler11.c Add solution for problem 11 vor 14 Jahren
euler12.c Added temporary answer for problem 12 vor 14 Jahren
euler13.c Added solution to problem 13 vor 14 Jahren
euler14.c Answer for problem 14 vor 13 Jahren
euler16.c Convert clang, also clean up warnings vor 13 Jahren
euler17.c Convert clang, also clean up warnings vor 13 Jahren
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) vor 13 Jahren
euler19.c Convert clang, also clean up warnings vor 13 Jahren
euler20.c Added solution to problem 20, very straight forward once large numbers are handled correctly vor 13 Jahren
euler21.c Added solution for problem 21 vor 13 Jahren
euler67.c Problem 67 is similar to problem 18, and also tests problem 18's solution on a larger data set vor 13 Jahren

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