 Philippe Zwietering
|
4154392eed
|
Finished PE 085, pretty quick solution with dp
|
2023-03-14 10:03:58 +01:00 |
|
 flip
|
0f525d4081
|
Finished projecteuler 084 with some proper rust code
|
2023-02-18 01:00:51 +01:00 |
|
|
flip
|
8ddefb903e
|
Added 'benchmarking' to projecteuler 082 and 083
|
2023-02-09 00:06:03 +01:00 |
|
|
flip
|
72f1368eda
|
Finished writing projecteuler 083 in a few minutes by basically copying 082
|
2023-02-08 23:57:05 +01:00 |
|
|
flip
|
f00e13bf26
|
Finished projecteuler 082 with pathfinding library, probably could have done it smarter
|
2023-02-08 23:50:19 +01:00 |
|
|
flip
|
e45df4dfed
|
Merge branch 'master' of ssh://git.pzwietering.nl:55555/flip/contests
|
2022-05-29 16:23:38 +02:00 |
|
|
flip
|
09e0d38e47
|
PE 081, added problem framework and input data, they are getting real hard all of a sudden
|
2022-05-29 16:22:12 +02:00 |
|
|
flip
|
4fdb2238d9
|
PE 081, finished by simple dynamic program
|
2022-05-08 00:15:18 +02:00 |
|
|
flip
|
dd43fcc0c5
|
PE 80, solved by digit-by-digit calculation
|
2022-05-06 15:58:38 +02:00 |
|
|
flip
|
679022c4cd
|
PE 79, didn't need to write code for this one, just looked at the text file for a few minutes
|
2022-05-02 16:16:38 +02:00 |
|
|
flip
|
b797dd3f84
|
PE 78, not the nicest solution, bruteforcing on euler recurrence relation
|
2022-05-02 15:55:09 +02:00 |
|
|
flip
|
ff7e343aff
|
PE 77, used dynamic programming
|
2022-05-02 15:06:28 +02:00 |
|
|
flip
|
fda564b4ed
|
PE 76, took a while to notice you need to subtract 1 from the partition function
|
2022-05-02 13:39:01 +02:00 |
|
|
flip
|
c9d461ba75
|
PE 075, pretty neat
|
2022-04-22 15:04:18 +02:00 |
|
|
flip
|
bd57e0590e
|
PE 074, for some reason I have to put in 57 instead of 60 but it works magically
|
2022-04-22 13:23:54 +02:00 |
|
|
flip
|
bfc7106e37
|
Finished 073 of projecteuler, not very fast solution
|
2022-04-22 12:03:17 +02:00 |
|
|
flip
|
93479faf32
|
Solved 72 with a good totient function I found online
|
2021-11-16 00:05:39 +01:00 |
|
|
flip
|
3d1ef6360b
|
Finished 071 by using fraction arithmetics
|
2021-11-15 01:39:00 +01:00 |
|
|
flip
|
20237a22af
|
Finished 070, by using the way quicker prime factorization it is done in 18 seconds
|
2021-11-14 22:25:02 +01:00 |
|
|
flip
|
673b908d16
|
Edited the prime factorization function of 69 so it is quick now
|
2021-11-14 22:20:56 +01:00 |
|
|
flip
|
ec1fae253d
|
Finished 69 (nice), wasn't too hard but my solution is pretty slow for some reason (19 s)
|
2021-11-14 21:24:24 +01:00 |
|
|
flip
|
d06da3219a
|
Solved 068 by hand
|
2021-11-13 13:55:57 +01:00 |
|
|
flip
|
e1ed7960aa
|
Added txt to their problem directory
|
2021-11-13 13:48:46 +01:00 |
|
|
flip
|
0e1b0de59f
|
067 pretty easy, just keep track of the maximum routes starting from the bottom
|
2021-11-13 13:29:55 +01:00 |
|
|
flip
|
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 |
|
|
flip
|
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 |
|
|
flip
|
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 |
|
|
flip
|
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 |
|
|
flip
|
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 |
|
|
flip
|
38ad5e4d1f
|
Cleaned up project euler folder and moved the license and readme
|
2021-10-30 19:59:38 +02:00 |
|
|
flip
|
e0c627a384
|
Rebased projecteuler folder, now includes all contest programming stuff
|
2021-10-26 10:54:24 +02:00 |
|