Project euler solutions
選択できるのは25トピックまでです。 トピックは、先頭が英数字で、英数字とダッシュ('-')を使用した35文字以内のものにしてください。
JD Cantrell 98190625e7
Add a make clean rule
13年前
.gitignore Update ignores for program files 14年前
Makefile Add a make clean rule 13年前
README Added answers for problem 15 (in readme) and problem 16 13年前
big_int.c Correct multiplication of two digit numbers in big_int 13年前
big_int.h Correct multiplication of two digit numbers in big_int 13年前
euler1.c Convert clang, also clean up warnings 13年前
euler2.c Convert clang, also clean up warnings 13年前
euler3.c Convert clang, also clean up warnings 13年前
euler4.c Convert clang, also clean up warnings 13年前
euler5.c Convert clang, also clean up warnings 13年前
euler6.c Convert clang, also clean up warnings 13年前
euler7.c Convert clang, also clean up warnings 13年前
euler8.c Convert clang, also clean up warnings 13年前
euler9.c Convert clang, also clean up warnings 13年前
euler10.c Add solution to problem 10, also re-learned max/min integer representation 14年前
euler11.c Add solution for problem 11 14年前
euler12.c Added temporary answer for problem 12 14年前
euler13.c Added solution to problem 13 14年前
euler14.c Answer for problem 14 13年前
euler16.c Convert clang, also clean up warnings 13年前
euler17.c Convert clang, also clean up warnings 13年前
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) 13年前
euler19.c Convert clang, also clean up warnings 13年前
euler20.c Added solution to problem 20, very straight forward once large numbers are handled correctly 13年前
euler21.c Added solution for problem 21 13年前
euler67.c Problem 67 is similar to problem 18, and also tests problem 18's solution on a larger data set 13年前

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