9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
|
#if 0
/* === aocYYYYDD =======================================================
===================================================================== */
void aocYYYYDD(char *data, size_t len) {
(void)len; // unused argument
}
#endif
/* === aoc202505 =======================================================
===================================================================== */
struct Range {
long long unsigned lo, hi;
};
void aoc202505(char *data, size_t len) {
(void)len; // unused argument
struct Range r[200] = {0};
size_t nr = 0;
char *err;
for (;;) {
char *minus = strchr(data, '-');
if (!minus) break;
*minus = 0;
r[nr].lo = strtoull(data, &err, 10);
*minus++ = '-';
char *enter = strchr(minus, '\n');
*enter = 0;
r[nr++].hi = strtoull(minus, &err, 10);
*enter++ = '\n';
data = enter;
}
unsigned fresh = 0;
for (;;) {
long long unsigned item = strtoull(data, &err, 10);
if (err[0] != '\n') break;
if (item == 0) break;
data = err + 1;
for (size_t k = 0; k < nr; k++) {
if ((r[k].lo <= item) && (item <= r[k].hi)) {
fresh++;
break;
}
}
}
printf("There are %u fresh items.\n", fresh);
// pause for brain storming pause
}
/* === aoc202504 =======================================================
===================================================================== */
static unsigned evolve(struct RectangularMap *rm, unsigned src) {
unsigned changes = 0;
unsigned dst = 1 - src;
for (int row = 0; row < rm->rows; row++) {
|