Compare commits

...

5 Commits

Author SHA1 Message Date
Jeff Yates 7574cfa2ae added code to solve part 2 2020-12-15 09:59:07 -05:00
Jeff Yates 2330820811 solved part 1 2020-12-15 08:42:23 -05:00
Jeff Yates 574ad7bff2 added input files 2020-12-15 07:37:32 -05:00
Jeff Yates 6a41c0a0fe solved both parts 2020-12-14 08:48:35 -05:00
Jeff Yates 28942a2c81 added input files 2020-12-14 07:01:26 -05:00
7 changed files with 924 additions and 0 deletions

780
day12/input Normal file
View File

@ -0,0 +1,780 @@
S1
R270
S5
W2
F63
S3
L90
W4
F59
S1
F21
W4
R90
W1
R180
S2
W2
F91
W5
R270
F97
R90
E2
R90
F6
W1
R90
W3
F1
S4
F1
N3
F76
S4
W5
F88
W4
N3
W2
F48
N1
F50
E3
F18
L90
F30
S3
R90
W1
N5
W1
R90
R90
E1
S2
F73
R90
S4
F89
F34
L90
F11
S3
F20
S5
E3
R180
E3
L90
E2
F1
E3
N3
F84
R90
E4
R180
F24
N3
L90
F15
W4
F52
S5
L180
N4
R90
E5
F11
S4
F27
R180
E4
R180
W3
N2
W1
S3
W4
E5
F97
L180
E3
N4
E3
S4
L90
S4
R90
N5
E1
S5
F19
E1
S2
L180
F36
S2
L90
W1
F8
W1
F67
E3
L90
F33
N4
F35
W2
F33
L180
N1
L90
R90
N3
W4
S1
F36
E2
F2
L90
W3
L90
E5
F4
L90
N1
N5
W4
N5
R90
W4
N5
W2
N5
F43
N3
W3
S2
W2
R90
E1
R90
F26
R90
E4
L270
F97
L180
N2
F2
R90
F33
E2
F85
E4
F80
R90
N2
L90
S5
F96
W1
S5
L180
F54
E3
F84
E3
L90
W1
N2
W4
L90
W4
F26
E5
R180
W1
F43
N4
E1
S4
S3
L90
N3
E1
F14
E1
N2
F93
S1
W3
N5
F15
W5
R90
F93
L90
E5
S4
E4
L90
E2
N4
F98
R90
W3
F100
R90
E2
F100
N5
F9
R90
F36
N3
W3
N4
F35
E3
R90
W4
L90
W3
F15
L90
F73
S2
E1
R180
F93
L270
F37
S1
F36
N1
E1
W1
R90
F46
W2
N4
F50
R90
W4
F90
L90
S3
F2
E1
L90
E5
S2
F91
W2
F21
E2
N2
W5
F79
E1
F77
L90
W5
N2
E3
L180
S2
W1
S1
R90
S5
R180
E2
F55
W4
R90
S3
L90
S1
R180
W4
R180
W5
S5
L180
F35
N1
F72
L90
W4
L180
S1
E1
N5
L90
W5
N1
E2
N4
W3
F3
W4
F96
E1
F20
R90
W4
F99
L90
E4
N3
N3
W3
N5
E2
N4
E4
L90
S2
W3
F3
R90
E2
R90
F23
N5
F39
W3
R90
N3
R180
R90
F94
W1
R90
N3
F16
R90
F61
R90
F67
N4
F72
S2
F39
W1
S1
R90
F67
S1
L90
W5
N5
E3
F65
E2
N1
S4
L90
N4
W5
R90
F49
L180
F22
E2
L90
N3
R90
F61
L180
F57
L90
F90
R90
E5
L180
E1
L180
S3
W4
F55
E1
F95
R180
W5
L180
F23
E3
F97
S1
F19
N2
W4
F10
L90
W4
S1
L90
W5
F64
R90
W4
F60
W4
L90
W3
F15
E5
N5
L90
S2
L180
F64
L180
F93
E5
F13
R270
S4
F58
R180
W5
S1
W4
N1
L270
S4
E4
N5
F38
W4
N2
W2
N1
R90
E1
L90
N2
R90
N3
E3
N3
F90
W2
L90
F95
S1
S4
F48
L270
W2
L90
F34
S3
F23
N2
F13
R180
E2
F95
L90
N2
R90
S2
E3
N1
F41
N2
R180
S4
W3
L90
W5
L90
F35
S5
E2
S5
E3
F81
W4
N3
F28
E1
F93
S3
F53
L90
W5
F59
W1
R90
E2
S5
F80
W3
S5
F6
R90
F8
W1
R180
E2
L270
N3
F59
W5
F51
R90
N2
E4
R90
E4
S1
W2
N1
F45
R90
N5
F28
L90
N4
F78
S1
R90
N5
L90
S2
F92
L180
E3
R90
F26
W1
L180
R90
S3
F51
N1
L90
W2
F84
L180
E1
F54
E4
F65
R90
S5
E2
F78
E1
R90
S1
R90
W3
R180
F99
E5
R90
F44
L90
W3
N3
R180
N4
E1
S4
L180
S4
F59
E4
F1
N5
R180
S5
L180
F38
E4
N3
R180
N1
W4
R90
F30
L90
S3
R90
F71
L90
E5
N4
R90
F50
N2
L180
F3
W5
L90
W5
R90
W5
N5
R180
E2
F39
W5
R90
F72
N5
E3
F37
S5
W1
F11
L180
E3
F55
R90
R90
F85
W4
F53
S1
F33
W4
L90
W5
F64
E5
R90
N1
R90
F14
N4
L180
S3
E1
F21
S2
F26
S5
F6
S2
L90
F50
N2
L180
W4
N2
E2
R90
F35
N1
F69
W3
N2
W3
L90
E1
S3
E4
F58
N1
W5
S5
L90
W1
S3
W1
S4
E4
R90
N5
R180
F57
L90
F69
W4
F2
R90
F1
L90
W1
S2
F40
S1
L180
F31
R180
F24
R90
S3
L180
S1
W2
F64
S1
W1
R180
W5
S3
L90
S5
E5
R90
E1
F5
N5
F3
W3
F57
R180
E3
F94
W1
F54
W4
S2
W2
N1
L90
W5
S4
L180
L90
F100
E3
R90
N5
E1
R90
E5
L90
S5
L90
S1
R90
E4
S1
W4
F65
R90
N3
W5
F64
R90
E5
R180
W5
F28
S5
L180
S5
R90
E4
F82

5
day12/input.sample Normal file
View File

@ -0,0 +1,5 @@
F10
N3
F7
R90
F11

47
day12/solution1.rb Executable file
View File

@ -0,0 +1,47 @@
#!/bin/env ruby
require 'pry'
def turn_ship (direction, degree, facing)
dirs = [:north, :east, :south, :west]
degree = degree / 90
degree = -degree if direction == 'L'
spin = dirs.find_index(facing) + degree
spin -= 4 if spin > 3
spin += 4 if spin < 0
return dirs[spin]
end
ship = {
:facing => :east,
:x_position => 0,
:y_position => 0 }
directions = File.read('./input').split("\n")
directions.each do |direction|
instruction = direction[0]
count = direction[1..-1].to_i
instruction = ship[:facing].to_s[0].upcase if instruction == 'F'
p [instruction, count]
case instruction
when 'N'
ship[:y_position] += count
when 'S'
ship[:y_position] -= count
when 'E'
ship[:x_position] += count
when 'W'
ship[:x_position] -= count
when 'R','L'
ship[:facing] = turn_ship(instruction, count, ship[:facing])
end
pp ship
end
manhattan = ship[:x_position].abs + ship[:y_position].abs
p manhattan
#binding.pry

70
day12/solution2.rb Executable file
View File

@ -0,0 +1,70 @@
#!/bin/env ruby
require 'pry'
def turn_ship (direction, degree, facing)
dirs = [:north, :east, :south, :west]
degree = degree / 90
degree = -degree if direction == 'L'
spin = dirs.find_index(facing) + degree
spin -= 4 if spin > 3
spin += 4 if spin < 0
return dirs[spin]
end
def rotate (direction, degree, waypoint)
degree = degree / 90
degree.times do
waypoint[:x_position], waypoint[:y_position] =
waypoint[:y_position], (waypoint[:x_position])
waypoint[:y_position] *= -1 if direction =='R'
waypoint[:x_position] *= -1 if direction == 'L'
end
return waypoint
end
ship = {
:facing => :east,
:x_position => 0,
:y_position => 0
}
waypoint = {
:x_position => 10,
:y_position => 1
}
directions = File.read('./input').split("\n")
directions.each do |direction|
instruction = direction[0]
count = direction[1..-1].to_i
p [instruction, count]
case instruction
when 'F'
count.times do
ship[:x_position] += waypoint[:x_position]
ship[:y_position] += waypoint[:y_position]
end
when 'N'
waypoint[:y_position] += count
when 'S'
waypoint[:y_position] -= count
when 'E'
waypoint[:x_position] += count
when 'W'
waypoint[:x_position] -= count
when 'R','L'
waypoint = rotate(instruction, count, waypoint)
end
pp ship
end
manhattan = ship[:x_position].abs + ship[:y_position].abs
p manhattan
#binding.pry

1
day15/input Normal file
View File

@ -0,0 +1 @@
14,1,17,0,3,20

1
day15/input.sample Normal file
View File

@ -0,0 +1 @@
0,3,6

20
day15/solution.rb Executable file
View File

@ -0,0 +1,20 @@
#!/bin/env ruby
require 'pry'
numbers = File.read('./input').split(',')
numbers.map!(&:to_i)
runs = 30000000
runs.times do |i|
next if i < numbers.size
num = numbers[-1]
prev_turn = numbers[..-2].reverse.find_index(num)
if prev_turn == nil
numbers.push(0)
else
new_num = (i - 1) - (numbers.size - 2 - prev_turn)
numbers.push(new_num)
end
end
puts numbers[-1]