1
2
3
4
5
6
7
8
9
10
11
12
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "aocutils.h"
static int safereport(int *v, int nv) {
int dir = 1; // ascending
if (v[0] > v[1]) dir = -1; // descending
for (int k = 1; k < nv; k++) {
if (v[k-1] == v[k]) return 0;
if (abs(v[k-1] - v[k]) > 3) return 0;
|
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
|
1
2
3
4
5
6
7
8
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
|
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "aocutils.h"
void aoc202403(char *data, [[maybe_unused]] size_t len) {
int sumproducts = 0, term[2];
char *rest = data;
for (;;) {
char *mul = strstr(rest, "mul(");
if (mul) {
rest = mul + 4;
if (isdigit((unsigned char)rest[0])) {
char *err;
term[0] = (int)strtol(rest, &err, 10);
if (*err == ',') {
if (isdigit((unsigned char)err[1])) {
rest = err + 1;
term[1] = (int)strtol(rest, &err, 10);
if (*err == ')') {
sumproducts += term[0] * term[1];
rest = err + 1;
}
}
}
}
} else {
break;
}
}
printf("The sum of the products is {%d}.\n", sumproducts);
}
static int safereport(int *v, int nv) {
int dir = 1; // ascending
if (v[0] > v[1]) dir = -1; // descending
for (int k = 1; k < nv; k++) {
if (v[k-1] == v[k]) return 0;
if (abs(v[k-1] - v[k]) > 3) return 0;
|