-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
45 lines (37 loc) · 995 Bytes
/
main.go
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
package main
import (
"github.com/danvolchek/AdventOfCode/lib"
"strings"
)
type card struct {
winners, yours lib.Set[int]
}
func parse(line string) card {
winners, yours, _ := strings.Cut(line, "|")
return card{
winners: lib.NewSet(lib.Ints(winners)[1:]),
yours: lib.NewSet(lib.Ints(yours)),
}
}
func solve(card card) int {
value := 0
for _, yours := range card.yours.Items() {
if card.winners.Contains(yours) {
switch value {
case 0:
value = 1
default:
value *= 2
}
}
}
return value
}
func main() {
solver := lib.Solver[[]card, int]{
ParseF: lib.ParseLine(parse),
SolveF: lib.SolveSum(solve),
}
solver.Expect("Card 1: 41 48 83 86 17 | 83 86 6 31 17 9 48 53\nCard 2: 13 32 20 16 61 | 61 30 68 82 17 32 24 19\nCard 3: 1 21 53 59 44 | 69 82 63 72 16 21 14 1\nCard 4: 41 92 73 84 69 | 59 84 76 51 58 5 54 83\nCard 5: 87 83 26 28 32 | 88 30 70 12 93 22 82 36\nCard 6: 31 18 13 56 72 | 74 77 10 23 35 67 36 11", 13)
solver.Verify(28538)
}