Day 6: Wait for It
Megathread guidelines
- Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
- Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ , pastebin, or github (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)
FAQ
- What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268
- Where do I participate?: https://adventofcode.com/
- Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465
Golang
Pretty straightforward. The only optimization I did is that the pairs are symmetric (3ms hold and 4ms travel is the same as 4ms hold and 3ms travel).
Part 1
file, _ := os.Open("input.txt") defer file.Close() scanner := bufio.NewScanner(file) scanner.Scan() times := strings.Fields(strings.Split(scanner.Text(), ":")[1]) scanner.Scan() distances := strings.Fields(strings.Split(scanner.Text(), ":")[1]) n := len(times) countProduct := 1 for i := 0; i < n; i++ { t, _ := strconv.Atoi(times[i]) d, _ := strconv.Atoi(distances[i]) count := 0 for j := 0; j <= t/2; j++ { if j*(t-j) > d { if t%2 == 0 && j == t/2 { count++ } else { count += 2 } } } countProduct *= count } fmt.Println(countProduct)
Part 2
file, _ := os.Open("input.txt") defer file.Close() scanner := bufio.NewScanner(file) scanner.Scan() time := strings.ReplaceAll(strings.Split(scanner.Text(), ":")[1], " ", "") scanner.Scan() distance := strings.ReplaceAll(strings.Split(scanner.Text(), ":")[1], " ", "") t, _ := strconv.Atoi(time) d, _ := strconv.Atoi(distance) count := 0 for j := 0; j <= t/2; j++ { if j*(t-j) > d { if t%2 == 0 && j == t/2 { count++ } else { count += 2 } } } fmt.Println(count)
ah damn, didn’t think of the symmetric pairs