-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday06.go
70 lines (60 loc) · 1.34 KB
/
day06.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
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
package main
import (
"aoc2021/util"
"fmt"
"math/big"
"strconv"
"strings"
"time"
)
func main() {
lines := util.GetLines("day06\\06.in")
start := time.Now()
day06a(lines)
duration := time.Since(start)
day06b(lines)
duration2 := time.Since(start)
fmt.Printf("p1: %s, p2: %s\n", duration, duration2-duration)
}
func popSize(days []*big.Int) (sum *big.Int) {
sum = big.NewInt(0)
for _, v := range days {
sum.Add(sum, v)
}
return sum
}
func increaseDay(days []*big.Int) []*big.Int {
nextday := make([]*big.Int, 9, 9)
for i := 0; i < 9; i++ {
nextday[i] = big.NewInt(0)
}
for i, v := range days {
if i == 0 {
nextday[6] = v
nextday[8] = v
} else {
nextday[i-1].Add(nextday[i-1], v)
}
}
return nextday
}
func day06a(lines []string) {
days := make([]*big.Int, 9, 9)
for i := 0; i < 9; i++ {
days[i] = big.NewInt(0)
}
for _, v := range strings.Split(lines[0], ",") {
i, _ := strconv.Atoi(v)
days[i].Add(days[i], big.NewInt(1))
}
for i := 0; i < 257+1; i++ {
if i == 1 || i == 18 || i == 80 || i == 256 || i == 9999999 {
fmt.Printf("Day: %d\tPopulation: %d\n", i, popSize(days))
}
days = increaseDay(days)
}
//fmt.Printf("Solution for part A: %d\n", days)
}
func day06b(lines []string) {
fmt.Printf("Solution for part B: %d\n", 3)
}