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
42
43
44
45
46
47
48
49
50
|
#include <ctype.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "aocdailies.h"
#include "aocutils.h"
/* === aoc202407 =======================================================
Part one looks easy
===================================================================== */
static bool canbetrue(unsigned v, unsigned *a, size_t n) {
// for startes let's assume no overflowing
if (n == 1) return (v == *a);
unsigned tmp = a[1];
a[1] = a[0] + tmp;
if (canbetrue(v, a+1, n-1)) return true;
a[1] = a[0] * tmp;
if (canbetrue(v, a+1, n-1)) return true;
a[1] = tmp;
return false;
}
void aoc202407(char *data, size_t len) {
(void)len; // unused argument
unsigned calibrationtotal = 0;
char *line = strtok(data, "\n");
unsigned number[50], nnumber, maxn = 0;
while (line) {
char *err;
unsigned testvalue = strtoul(line, &err, 10);
err += 1; // skip ':'
nnumber = 0;
while (*err == ' ') {
number[nnumber++] = strtoul(err, &err, 10);
}
if (canbetrue(testvalue, number, nnumber)) calibrationtotal += testvalue;
if (nnumber > maxn) { maxn = nnumber; printf("max: %u\n", maxn); }
printf("The calibration total is {%u}.\n", calibrationtotal);
}
/* === aoc202406 =======================================================
Hmmm, I've done something like this already this year... on day 4
I need rcmap() moved to aocutils ... done; now it's called `linearize2d`
Part Two: brute force? It likely is faster than coming up with an algo
Let's go: save map, for every available position put in an obstacle,
|
|
|
|
|
<
|
|
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
42
43
44
45
46
47
48
49
|
#include <ctype.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "aocdailies.h"
#include "aocutils.h"
/* === aoc202407 =======================================================
Part one looks easy
===================================================================== */
static bool canbetrue(unsigned long long v, unsigned long long *a, size_t n) {
// for startes let's assume no overflowing
if (n == 1) return (v == *a);
unsigned tmp = a[1];
a[1] = a[0] + tmp;
if (canbetrue(v, a+1, n-1)) return true;
a[1] = a[0] * tmp;
if (canbetrue(v, a+1, n-1)) return true;
a[1] = tmp;
return false;
}
void aoc202407(char *data, size_t len) {
(void)len; // unused argument
unsigned long long calibrationtotal = 0;
char *line = strtok(data, "\n");
unsigned long long number[50], nnumber;
while (line) {
char *err;
unsigned long long testvalue = strtoull(line, &err, 10);
err += 1; // skip ':'
nnumber = 0;
while (*err == ' ') {
number[nnumber++] = strtoul(err, &err, 10);
}
if (canbetrue(testvalue, number, nnumber)) calibrationtotal += testvalue;
line = strtok(NULL, "\n");
}
printf("The calibration total is {%llu}.\n", calibrationtotal);
}
/* === aoc202406 =======================================================
Hmmm, I've done something like this already this year... on day 4
I need rcmap() moved to aocutils ... done; now it's called `linearize2d`
Part Two: brute force? It likely is faster than coming up with an algo
Let's go: save map, for every available position put in an obstacle,
|