spogulis no https://github.com/jdcantrell/euler
Nevar pievienot vairāk kā 25 tēmas
Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.
JD Cantrell
98190625e7
|
pirms 13 gadiem | |
---|---|---|
.gitignore | pirms 14 gadiem | |
Makefile | pirms 13 gadiem | |
README | pirms 13 gadiem | |
big_int.c | pirms 13 gadiem | |
big_int.h | pirms 13 gadiem | |
euler1.c | pirms 13 gadiem | |
euler2.c | pirms 13 gadiem | |
euler3.c | pirms 13 gadiem | |
euler4.c | pirms 13 gadiem | |
euler5.c | pirms 13 gadiem | |
euler6.c | pirms 13 gadiem | |
euler7.c | pirms 13 gadiem | |
euler8.c | pirms 13 gadiem | |
euler9.c | pirms 13 gadiem | |
euler10.c | pirms 14 gadiem | |
euler11.c | pirms 14 gadiem | |
euler12.c | pirms 14 gadiem | |
euler13.c | pirms 14 gadiem | |
euler14.c | pirms 13 gadiem | |
euler16.c | pirms 13 gadiem | |
euler17.c | pirms 13 gadiem | |
euler18.c | pirms 13 gadiem | |
euler19.c | pirms 13 gadiem | |
euler20.c | pirms 13 gadiem | |
euler21.c | pirms 13 gadiem | |
euler67.c | pirms 13 gadiem |
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