-
Notifications
You must be signed in to change notification settings - Fork 0
/
trebuchet.d
132 lines (127 loc) · 3.03 KB
/
trebuchet.d
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
import std.stdio;
import std.file : readText;
import std.algorithm;
import std.range;
import std.conv;
import std.string;
import std.ascii : isDigit;
import std.utf : byChar;
import std.array : array;
int part2a(string[] input)
{
string[string] substitutions = [
"one" : "1",
"two" : "2",
"three" : "3",
"four" : "4",
"five" : "5",
"six" : "6",
"seven" : "7",
"eight" : "8",
"nine" : "9",
];
string doReplacing(string s)
{
auto orig = s;
outer:
foreach(idx; 0 .. s.length)
{
foreach(k, v; substitutions)
{
if(s[idx].isDigit)
break outer;
if(s[idx .. $].startsWith(k))
{
s = s[0 .. idx] ~ v ~ s[idx + k.length .. $];
break outer;
}
}
}
outer2:
foreach_reverse(idx; 0 .. s.length)
{
foreach(k, v; substitutions)
{
if(s[idx].isDigit)
break outer2;
if(s[idx .. $].startsWith(k))
{
s = s[0 .. idx] ~ v ~ s[idx + k.length .. $];
break outer2;
}
}
}
//writefln("orig: %s, new: %s", orig, s);
return s;
}
return input
.map!(s => doReplacing(s))
.map!((s) {
auto f = s.byChar.filter!(c => c.isDigit).array;
return only(f.front, f.back).to!int;
})
.sum;
}
int part2b(string[] input)
{
string[] digits = [
"one",
"two",
"three",
"four",
"five",
"six",
"seven",
"eight",
"nine"
];
int sum = 0;
foreach(line; input)
{
int frontDigit, backDigit;
foreach(i; 0 .. line.length)
{
if(isDigit(line[i]))
{
frontDigit = line[i] - '0';
break;
}
auto d = digits.countUntil!(x => line[i .. $].startsWith(x));
if(d >= 0)
{
frontDigit = cast(int)(d + 1);
break;
}
}
foreach_reverse(i; 0 .. line.length)
{
if(isDigit(line[i]))
{
backDigit = line[i] - '0';
break;
}
auto d = digits.countUntil!(x => line[i .. $].startsWith(x));
if(d >= 0)
{
backDigit = cast(int)(d + 1);
break;
}
}
sum += frontDigit * 10 + backDigit;
}
return sum;
}
void main(string[] args)
{
auto input = readText(args[1]).split;
auto answer1 = input
.map!((s) {
auto f = s.byChar.filter!(c => c.isDigit).array;
if(f.empty) return 0;
return only(f.front, f.back).to!int;
})
.sum;
writeln(answer1);
writeln(part2a(input));
writeln(part2b(input));
}