Bananymous
4e900804b8
AOC2023: Implement day16
2023-12-19 22:22:16 +02:00
Bananymous
9ec733904f
AOC2023: Implement day15
2023-12-19 21:42:59 +02:00
Bananymous
f46240e879
AOC2023: Implement day14
2023-12-19 02:49:48 +02:00
Bananymous
68627995f8
AOC2023: Implement day13
2023-12-19 01:25:23 +02:00
Bananymous
8344f2f9ab
AOC2023: Fix day3 implementation
...
I accidently broke my day3 when messing with signed/unsigned integers
2023-12-14 11:03:19 +02:00
Bananymous
862993398d
AOC2023: Implement day12
...
There seems to be a problem with my malloc so the hash map is not
working. This code worked fine on my linux with actually working
malloc :D
2023-12-14 10:51:48 +02:00
Bananymous
225c7c6ab4
AOC2023: Implement day11
2023-12-11 14:36:33 +02:00
Bananymous
58633ca373
AOC2023: Remove unnecessary loop
2023-12-10 20:18:59 +02:00
Bananymous
00d57d783e
LibC+userspace: Make everything compile with -Wall -Wextra -Werror
...
I added -Wall -Wextra -Werror as public compile flags to libc. Now
everything in userspace in compiled using these flags. I made all
necessary changes to allow compilation to work.
Only exception is execvp which has a large stack usage. Maybe it
should use malloc for the buffer but posix allows ENOMEM only when
kernel is out of memory... This can be fixed when fexecve is
implemented and there is no need for absolute path.
2023-12-10 19:20:14 +02:00
Bananymous
f077e17b2a
AOC2023: Implement day10
2023-12-10 18:28:04 +02:00
Bananymous
99a5b6e2ef
AOC2023: Cleanup day9 code
...
Move tree building to its own function. Both parts can use the same
tree. This also decreaseas memory usage by one element by row :D
2023-12-09 19:08:13 +02:00
Bananymous
0c3e5980d6
AOC2023: Implement day9
2023-12-09 16:22:43 +02:00
Bananymous
2b927b9729
BAN: Restructure sort functions and namespaces
2023-12-08 18:58:47 +02:00
Bananymous
b523ccb893
AOC2023: Implement day8
...
Second part was kinda weird. You are supposted to assume something
of the input, which necessarily is not true.
2023-12-08 17:13:20 +02:00
Bananymous
7bb3172591
AOC2023: Use the default sort algorithm
2023-12-08 00:10:59 +02:00
Bananymous
669d55707e
AOC2023: Use quick sort in solution
2023-12-07 11:55:28 +02:00
Bananymous
536bb74d53
AOC2023: optimize hand score calculation
2023-12-07 09:26:17 +02:00
Bananymous
efd8be8207
AOC2023: implement day7
2023-12-07 07:56:56 +02:00
Bananymous
531211e09d
AOC2023: implement day6
2023-12-06 07:27:25 +02:00
Bananymous
82cb2ea20b
AOC2023: implement day5
2023-12-05 09:13:13 +02:00
Bananymous
cf76d2e7d9
AOC2023: remove unnecessary loop
2023-12-04 17:54:10 +02:00
Bananymous
41f8974080
AOC2023: implement day4
2023-12-04 17:51:27 +02:00
Bananymous
3ed25425a3
AOC2023: implement day3
...
Solution to second puzzle is not optimal, it definately should be
O(1) space, but I didn't want to think about it.
2023-12-03 17:07:09 +02:00
Bananymous
49f8c4268f
AOC2023: implement day2
2023-12-02 16:10:37 +02:00
Bananymous
70c224d8ea
AOC2023: Cleanup day1 code
2023-12-01 13:31:55 +02:00
Bananymous
6a7335e5c9
AOC2023: implement day1
2023-12-01 12:38:01 +02:00
Bananymous
3aaa755c51
AOC2023: update buildsystem
2023-12-01 12:38:01 +02:00
Bananymous
dabd79afa7
Userspace: Prepare aoc2023 environment :)
2023-12-01 01:22:53 +02:00
Bananymous