Advent of Code

Check-in [a42eafcdd1]
Login

Check-in [a42eafcdd1]

Overview
Comment:day 10 on hold
Downloads: Tarball | ZIP archive
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA3-256: a42eafcdd1089a2c797cf29154609894ffe19053d09d969a01724a4533b05a70
User & Date: nnz on 2025-12-10 12:25:47.750
Other Links: manifest | tags
Context
2025-12-11
12:10
set up for day 11 check-in: efa404a0e6 user: nnz tags: trunk
2025-12-10
12:25
day 10 on hold check-in: a42eafcdd1 user: nnz tags: trunk
2025-12-09
11:06
2025, day 9, part1 check-in: b43933ad99 user: nnz tags: trunk
Changes
Modified aoc2025.c from [d27e7567fd] to [5dbb3f8d74].
11
12
13
14
15
16
17







18
19
20
21
22
23
24
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31







+
+
+
+
+
+
+







/* === aocYYYYDD =======================================================
===================================================================== */
void aocYYYYDD(char *data, size_t len) {
    (void)len; // unused argument
}

#endif

/* === aoc202510 =======================================================
===================================================================== */
void aoc202510(char *data, size_t len) {
    (void)len; // unused arguments
    (void)data;
}

/* === aoc202509 =======================================================
===================================================================== */
struct iCoords {
    int row, col;
};

32
33
34
35
36
37
38
39
40


41
42
43
44
45
46
47
39
40
41
42
43
44
45


46
47
48
49
50
51
52
53
54







-
-
+
+







        if (*err != ',') break;
        err++;
        p[k++].col = strtol(err, &err, 10);
    }
    long long max_area = 0;
    for (int i = 0; i < k; i++) {
        for (int j = i + 1; j < k; j++) {
            long long area = 1LL * (abs(p[i].col - p[j].col) + 1)
                                 * (abs(p[i].row - p[j].row) + 1);
            long long area = (abs(p[i].col - p[j].col) + 1LL)
                           * (abs(p[i].row - p[j].row) + 1LL);
            if (area > max_area) max_area = area;
        }
    }
    printf("P1: %lld\n", max_area);
}

/* === aoc202508 =======================================================
1
2
3
4
5
6
7
8

9
10
11
12
13
14
15
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16








+







#include <stddef.h>
#include "aocdailies.h"

aocfunc *aocselect(unsigned y, unsigned d) {
    aocfunc *p;
    switch (y * 100 + d) {
        default: p = NULL; break;

        case 202510: p = aoc202510; break;
        case 202509: p = aoc202509; break;
        case 202508: p = aoc202508; break;
        case 202507: p = aoc202507; break;
        case 202506: p = aoc202506; break;
        case 202505: p = aoc202505; break;
        case 202504: p = aoc202504; break;
        case 202503: p = aoc202503; break;
1
2
3
4
5
6
7
8

9
10
11
12
13
14
15
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16








+







#ifndef AOCDAILIES_H_INCLUDED
#define AOCDAILIES_H_INCLUDED

#include <stddef.h>

typedef void aocfunc(char *, size_t);
aocfunc *aocselect(unsigned, unsigned);

aocfunc aoc202510;
aocfunc aoc202509;
aocfunc aoc202508;
aocfunc aoc202507;
aocfunc aoc202506;
aocfunc aoc202505;
aocfunc aoc202504;
aocfunc aoc202503;