adyxax/advent-of-code
1
0
Fork 0
Code Issues Pull requests Activity

Added solutions for 6th day

Browse source
This commit is contained in:
Julien Dessaux 2021-12-08 15:47:01 +01:00
parent bb16e47b8e
commit 5253b7c559
4 changed files with 70 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
2021/06/example Normal file
View file

@ -0,0 +1 @@
3,4,3,1,2

34
2021/06/first.go Normal file
View file

@ -0,0 +1,34 @@
package main
import (
"bufio"
"fmt"
"os"
)
func main() {
g := make([]int, 9)
s := bufio.NewReader(os.Stdin)
for {
buf := make([]byte, 2)
if n, _ := s.Read(buf); n == 0 {
break
}
g[buf[0]-'0']++
}
for d := 0; d <= 80; d++ {
fmt.Printf("%+v\n", g)
n := g[0]
for i := 0; i < 8; i++ {
g[i] = g[i+1]
}
g[6] += n
g[8] = n
}
total := 0
for i := 0; i < 8; i++ {
total += g[i]
}
fmt.Printf("%d\n", total)
}

1
2021/06/input Normal file
View file

@ -0,0 +1 @@
1,1,3,1,3,2,1,3,1,1,3,1,1,2,1,3,1,1,3,5,1,1,1,3,1,2,1,1,1,1,4,4,1,2,1,2,1,1,1,5,3,2,1,5,2,5,3,3,2,2,5,4,1,1,4,4,1,1,1,1,1,1,5,1,2,4,3,2,2,2,2,1,4,1,1,5,1,3,4,4,1,1,3,3,5,5,3,1,3,3,3,1,4,2,2,1,3,4,1,4,3,3,2,3,1,1,1,5,3,1,4,2,2,3,1,3,1,2,3,3,1,4,2,2,4,1,3,1,1,1,1,1,2,1,3,3,1,2,1,1,3,4,1,1,1,1,5,1,1,5,1,1,1,4,1,5,3,1,1,3,2,1,1,3,1,1,1,5,4,3,3,5,1,3,4,3,3,1,4,4,1,2,1,1,2,1,1,1,2,1,1,1,1,1,5,1,1,2,1,5,2,1,1,2,3,2,3,1,3,1,1,1,5,1,1,2,1,1,1,1,3,4,5,3,1,4,1,1,4,1,4,1,1,1,4,5,1,1,1,4,1,3,2,2,1,1,2,3,1,4,3,5,1,5,1,1,4,5,5,1,1,3,3,1,1,1,1,5,5,3,3,2,4,1,1,1,1,1,5,1,1,2,5,5,4,2,4,4,1,1,3,3,1,5,1,1,1,1,1,1

34
2021/06/second.go Normal file
View file

@ -0,0 +1,34 @@
package main
import (
"bufio"
"fmt"
"os"
)
func main() {
g := make([]int, 9)
s := bufio.NewReader(os.Stdin)
for {
buf := make([]byte, 2)
if n, _ := s.Read(buf); n == 0 {
break
}
g[buf[0]-'0']++
}
for d := 0; d <= 256; d++ {
fmt.Printf("%+v\n", g)
n := g[0]
for i := 0; i < 8; i++ {
g[i] = g[i+1]
}
g[6] += n
g[8] = n
}
total := 0
for i := 0; i < 8; i++ {
total += g[i]
}
fmt.Printf("%d\n", total)
}