[2016][ruby][19.1]

profile
Alpha Chen 8 years ago
parent 592d8b2384
commit 3c99f5cf03

@ -1,16 +1,35 @@
Elf = Struct.new(:id, :presents)
n = 3017957
elves = Array.new(n) {|i| Elf.new(i+1, 1) }
def solve(n, debug: false)
elves = Array.new(n) {|i| i+1 }
until elves.size == 1
elf = elves.shift
next if elf.presents.zero?
across = elves.size / 2
elves.delete_at(across)
elves.rotate!
end
elves.first
end
elf.presents += elves.first.presents
elves.first.presents = 0
# This takes too long
# n = 3017957
# puts solve(n)
elves << elf
# So instead use this to find the pattern!
(1..100).each do |i|
puts "#{i}: #{solve(i)}"
end
p elves
# At 3**n, the counter resets
# At 2*3**n, the counter goes up by two instead of one
include Math
def formula(n)
x = log(n, 3).to_i
a = 3**x
b = 2*a
(n == a) ? a : n - a + [(n - b), 0].max
end
(1..100).each do |n|
puts "#{n}: #{solve(n)} #{formula(n)}"
end

Loading…
Cancel
Save