yury-fedorov / aoc Goto Github PK

View Code? Open in Web Editor NEW

3.0 3.0 3.0 2.77 MB

https://adventofcode.com/

License: MIT License

C# 30.80% F# 1.09% Scala 0.75% CMake 0.71% C++ 29.34% Java 20.73% Rust 6.72% Dockerfile 0.04% Go 9.82%

aoc's People

Contributors

Stargazers

Watchers

Forkers

davidpeklak volodg yuryf-google

aoc's Issues

Here are some other examples:

The earliest timestamp that matches the list 17,x,13,19 is 3417.
67,7,59,61 first occurs at timestamp 754018.
67,x,7,59,61 first occurs at timestamp 779210.
67,7,x,59,61 first occurs at timestamp 1261476.
1789,37,47,1889 first occurs at timestamp 1202161486.

However, with so many bus IDs in your list, surely the actual earliest timestamp will be larger than 100000000000000!

What is the earliest timestamp such that all of the listed bus IDs depart at offsets matching their positions in the list?

C++ enum class and no default in enums

AoC18 Day 17 Part 1 - Reservoir Research

https://adventofcode.com/2018/day/17

AoC 15 Day 20 Part 1 - Infinite Elves and Infinite Houses

https://adventofcode.com/2015/day/20

the first nine houses on the street end up like this:

House 1 got 10 presents.
House 2 got 30 presents.
House 3 got 40 presents.
House 4 got 70 presents.
House 5 got 60 presents.
House 6 got 120 presents.
House 7 got 80 presents.
House 8 got 150 presents.
House 9 got 130 presents.

The first house gets 10 presents: it is visited only by Elf 1, which delivers 1 * 10 = 10 presents. The fourth house gets 70 presents, because it is visited by Elves 1, 2, and 4, for a total of 10 + 20 + 40 = 70 presents.

What is the lowest house number of the house to get at least as many presents as the number in your puzzle input?

Your puzzle input is 34000000.

AoC22 Day15 Part2

Day 19 - Go With The Flow

https://adventofcode.com/2018/day/19

AoC22 Day16

AoC 20 Day 20 Part 2 - Jurassic Jigsaw

https://adventofcode.com/2020/day/20

AoC18 Day 22 Part 2 - Mode Maze

https://adventofcode.com/2018/day/22

AoC15 Day 19 Part 2 - Medicine for Rudolph

https://adventofcode.com/2015/day/19

Molecule fabrication always begins with just a single electron, e, and applying replacements one at a time, just like the ones during calibration.

How long will it take to make the medicine? Given the available replacements and the medicine molecule in your puzzle input, what is the fewest number of steps to go from e to the medicine molecule?

With these changes, what is the new lowest house number of the house to get at least as many presents as the number in your puzzle input?

AoC19 Day 17 - Set and Forget

https://adventofcode.com/2019/day/17
To be developed using Intcode

....###########............................
....#.........#............................
....#.........#............................
....#.........#............................
....#.........#............................
....#.........#............................
....#.........#............................
....#.........#............................
....#############..........................
..............#.#..........................
..............#.#..........................
..............#.#..........................
..............###########..................
................#.......#..................
................#.......#..................
................#.......#..................
................###########...############^
........................#.#...#............
........................#.#...#............
........................#.#...#............
........................#.#...#............
........................#.#...#............
........................#.#...#............
........................#.#...#............
................#########.#...#............
................#.........#...#............
....#########...#.....#########............
....#.......#...#.....#...#................
....#.......#.#############................
....#.......#.#.#.....#....................
....#.......#.#.#.....#....................
....#.......#.#.#.....#....................
....#.......#.#.#.....#....................
....#.......#.#.#.....#....................
....#############.....#....................
............#.#.......#....................
#############.#.......#....................
#.............#.......#....................
#.............#########....................
#..........................................
#.#########................................
#.#........................................
#.#........................................
#.#........................................
#.#........................................
#.#........................................
#.#........................................
#.#........................................
###########................................
..#.......#................................
..#.......#................................
..#.......#................................
..###########..............................
..........#.#..............................
..........#.#..............................
..........#.#..............................
..........#############....................
............#.........#....................
............#.........#....................
............#.........#....................
............#.........#....................
............#.........#....................
............#.........#....................
............#.........#....................
............###########....................