|
|
d06da3219a
|
Solved 068 by hand
|
2021-11-13 13:55:57 +01:00 |
|
|
|
e1ed7960aa
|
Added txt to their problem directory
|
2021-11-13 13:48:46 +01:00 |
|
|
|
0e1b0de59f
|
067 pretty easy, just keep track of the maximum routes starting from the bottom
|
2021-11-13 13:29:55 +01:00 |
|
|
|
8f5217e793
|
Solved 66, made some initialization error and had to gradually build up the chain instead of recomputing it everytime
|
2021-11-13 01:52:05 +01:00 |
|
|
|
d2d19d3efa
|
Added bigint header file and edited the solution to include bigint to correctly handle the large numbers
|
2021-11-10 13:07:18 +01:00 |
|
Philippe Zwietering
|
26b32ce7c8
|
Woops had a erroneous function in problem 066
|
2021-11-09 16:12:37 +01:00 |
|
Philippe Zwietering
|
2477b229d5
|
Found the solution for 066, now just have to work out the implementation
|
2021-11-09 16:11:25 +01:00 |
|
|
|
aafaeb91fc
|
I solved it by using someones pseudocode and to be honest I don't completely understand how it works
|
2021-11-06 13:48:12 +01:00 |
|
|
|
7430bccec9
|
Finished 62 in a jiffy, wasn't hard when using a sorted list to keep track of the found cubes
|
2021-11-02 13:50:35 +01:00 |
|
|
|
f649acf5a3
|
Did it all on my own, while being incredibly quick at the same time, very proud
|
2021-11-02 12:55:06 +01:00 |
|
|
|
38ad5e4d1f
|
Cleaned up project euler folder and moved the license and readme
|
2021-10-30 19:59:38 +02:00 |
|
|
|
e0c627a384
|
Rebased projecteuler folder, now includes all contest programming stuff
|
2021-10-26 10:54:24 +02:00 |
|
