Advent of code 2025 (not proud)

day 4 wip

Changed files
+83
day_4
day_4/4

This is a binary file and will not be displayed.

+73
day_4/4.c
···
···
+
#include <stddef.h>
+
#include <stdio.h>
+
#include <stdlib.h>
+
+
+
int get_acces(int** matrix,int i,int j) {
+
int neighbors = 0;
+
+
+
}
+
+
int main(int argc, char* argv[]) {
+
+
+
FILE* f = NULL;
+
char* line = NULL;
+
size_t size = 0;
+
ssize_t nread = 0;
+
int len = 0;
+
int w = 0;
+
+
int** matrix_ptr = NULL;
+
+
+
f = fopen(argv[1], "r");
+
+
+
while ((nread = getline(&line, &size, f)) != -1) {
+
w = nread-2;
+
matrix_ptr = (int **)realloc(matrix_ptr, (len+1) * (nread-2)*sizeof(int));
+
matrix_ptr[len] = (int *)malloc((nread-2)*sizeof(int));
+
for (int i = 0; i< nread-1; i++) {
+
if (line[i] == '@') {
+
matrix_ptr[len][i] = 1;
+
+
} else {
+
matrix_ptr[len][i] = 0;
+
}
+
// printf("%d",(&matrix_ptr)[j][i]);
+
}
+
len++;
+
}
+
+
// just a matrix out of input.
+
+
//
+
// [(i-1,j-1)][(i-1,j)] [(i-1,j+1)]
+
// [(i,j-1)] [(i,j)] [(i,j+1)]
+
// [(i+1,j-1)][(i+1,j)] [(i+1,j+1)]
+
// check all of those in clockwise order
+
//
+
+
+
+
+
for (int i = 0; i<len; i++) {
+
for (int j = 0; j<w+1; j++) {
+
printf("%d",matrix_ptr[i][j]);
+
+
}
+
printf("\n");
+
}
+
+
+
+
+
+
+
free(matrix_ptr);
+
free(f);
+
free(line);
+
return 0;
+
}
+10
day_4/mini.txt
···
···
+
..@@.@@@@.
+
@@@.@.@.@@
+
@@@@@.@.@@
+
@.@@@@..@.
+
@@.@@@@.@@
+
.@@@@@@@.@
+
.@.@.@.@@@
+
@.@@@.@@@@
+
.@@@@@@@@.
+
@.@.@@@.@.