Advent of code 2025 (not proud)
technoduck.me
1#include <stddef.h>
2#include <stdio.h>
3#include <stdlib.h>
4
5
6int get_acces(int** matrix,int i,int j) {
7int neighbors = 0;
8
9
10}
11
12int main(int argc, char* argv[]) {
13
14
15 FILE* f = NULL;
16 char* line = NULL;
17 size_t size = 0;
18 ssize_t nread = 0;
19 int len = 0;
20 int w = 0;
21
22 int** matrix_ptr = NULL;
23
24
25 f = fopen(argv[1], "r");
26
27
28 while ((nread = getline(&line, &size, f)) != -1) {
29 w = nread-2;
30 matrix_ptr = (int **)realloc(matrix_ptr, (len+1) * (nread-2)*sizeof(int));
31 matrix_ptr[len] = (int *)malloc((nread-2)*sizeof(int));
32 for (int i = 0; i< nread-1; i++) {
33 if (line[i] == '@') {
34 matrix_ptr[len][i] = 1;
35
36 } else {
37 matrix_ptr[len][i] = 0;
38 }
39 // printf("%d",(&matrix_ptr)[j][i]);
40 }
41 len++;
42 }
43
44 // just a matrix out of input.
45
46//
47 // [(i-1,j-1)][(i-1,j)] [(i-1,j+1)]
48 // [(i,j-1)] [(i,j)] [(i,j+1)]
49 // [(i+1,j-1)][(i+1,j)] [(i+1,j+1)]
50 // check all of those in clockwise order
51 //
52
53
54
55
56 for (int i = 0; i<len; i++) {
57 for (int j = 0; j<w+1; j++) {
58 printf("%d",matrix_ptr[i][j]);
59
60 }
61 printf("\n");
62 }
63
64
65
66
67
68
69 free(matrix_ptr);
70 free(f);
71 free(line);
72 return 0;
73}