-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
96 lines (75 loc) · 1.34 KB
/
main.go
File metadata and controls
96 lines (75 loc) · 1.34 KB
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
package main
import (
"fmt"
"github.com/danvolchek/AdventOfCode/lib"
)
func fromSnafu(num string) uint64 {
var val uint64
var multiplier uint64 = 1
for i := len(num) - 1; i >= 0; i-- {
switch num[i] {
case '-':
val -= multiplier
case '=':
val -= multiplier * 2
default:
val += multiplier * uint64(num[i]-'0')
}
multiplier *= 5
}
return val
}
func toBase5(num uint64) []int {
var result []int
for num >= 0 {
result = append([]int{int(num % 5)}, result...)
num /= 5
if num == 0 {
break
}
}
return result
}
func toSnafu(num uint64) string {
base5 := toBase5(num)
fmt.Println(base5)
for i := 0; i < len(base5); i++ {
if base5[i] > 2 {
base5[i] -= 5
base5[i-1] += 1
fmt.Println(base5)
i = 0
}
}
var result string
for _, val := range base5 {
var char string
switch val {
case -2:
char = "="
case -1:
char = "-"
case 0:
char = "0"
case 1:
char = "1"
case 2:
char = "2"
}
result += char
}
return result
}
func solve(snafus []string) string {
nums := lib.Map(snafus, fromSnafu)
sum := lib.SumSlice(nums)
return toSnafu(sum)
}
func main() {
solver := lib.Solver[[]string, string]{
ParseF: lib.ParseLine(lib.AsIs),
SolveF: solve,
}
solver.Expect("1=-0-2\n12111\n2=0=\n21\n2=01\n111\n20012\n112\n1=-1=\n1-12\n12\n1=\n122", "2=-1=0")
solver.Solve()
}