Commit Graph

21 Commits

Author SHA1 Message Date
911a60ab6c y2024d21p1 this is hard 2024-12-23 14:57:40 +01:00
5ce4e2b51b y2024d20p1 really inefficient, got more efficient version now 2024-12-20 10:53:03 +01:00
a83cef34f0 y2024d19 2024-12-19 15:59:57 +01:00
78df584c4d y2024d18 2024-12-18 14:30:44 +01:00
27a236f958 y2024d17p1 done working on p2 2024-12-17 14:44:00 +01:00
b20aa6fbdc prepare files y2024d16 2024-12-16 11:24:17 +01:00
86c52a1a59 pre y2024d15 2024-12-15 20:33:09 +01:00
f56780d1cf y2024d14 tipp from reddit, most robots form the tree aka not evenly spread aka use quadrants and check all frames where they are not even 2024-12-14 23:08:31 +01:00
fa842890ce y2024d13 gonna be honest here, I was too lazy to do part2 by myself. I could have done it but it wold have taken some time as I have to remember how to solve linear equations 2024-12-13 14:03:36 +01:00
93ce6d0719 y2024d12 2024-12-12 11:38:16 +01:00
c46843cf5a y2024d11 2024-12-11 16:19:17 +01:00
64cb7fb370 y2024d10 2024-12-10 10:32:05 +01:00
99430e8e26 y2024d9 2024-12-09 13:20:27 +01:00
0dec0bbf82 y2024d8 2024-12-08 16:35:33 +01:00
2a91587ae5 y2024d7 2024-12-08 11:40:52 +01:00
dbf878baf1 y2024d6 2024-12-08 11:40:24 +01:00
fa52f5bd13 y2024d5 2024-12-05 09:13:24 +01:00
5a17373244 y2024d4 2024-12-04 11:19:28 +01:00
5bd059970e y2024d3 first try part 2 2024-12-03 10:11:59 +01:00
67d3a56011 y2024d2 2024-12-02 10:47:39 +01:00
Fabian Schmidt
a1183f8ef4 y2024d1 2024-12-01 20:24:01 +01:00