gurgeous

# add node_modules to $PATH
export PATH := justfile_directory() + "/node_modules/.bin:" + env_var('PATH')

# first recipe is always default - list these rules
default:
  @just --list

# everything ok? good to run before commit
check:
  @for i in tsc lint test vitest; do \

gurgeous

#!/bin/bash

set -euo pipefail

# sanity checking
if [[ $# -ne 1 ]] ; then
  echo 'usage: v <file>'
  exit 0
fi
if ! [ -f "$1" ]; then

gurgeous

#
# Reload localhost tabs. Sample usage:
#
# $ brew install watchexec
# $ watchexec --watch <DIRNAME> reload.osa
#

tell application "Google Chrome"
	set window_list to every window
	repeat with the_window in window_list

gurgeous

def tally(data, ii)
  Hash.new(0).tap do |h|
    data.each { h[_1[ii]] += 1 }
  end
end

n = data.first.length

# part 1
gamma = (0...n).map do |ii|

gurgeous

1000tablets.com
100sildenafil.com
100viagra.com
20tadalafil.com
365tablets.com
366pills.com
555meds.com
555pharmacy.com
999pills.com
999tabs.com

gurgeous

#
# Improved rake autocomplete. It completes three different items:
#
# (1) options like "rake --trace" or "rake --verbose"
# (2) tasks like "rake db:migrate"
# (3) files like "rake test/lib/util.rb"
#
# Options and tasks are defined using the variables below. This doesn't try to
# build a task name cache or anything like that.
#

gurgeous

def solve(key)
  (0..).inject(1) do |memo, n|
    return n if memo == key
    (memo * 7) % 20201227
  end
end

def transform(subject, n)
  (1..n).inject(1) { |memo, _| (memo * subject) % 20201227 }
end

gurgeous

DIRS = {
  'e' => [ 1, 0 ],
  'w' => [ -1, 0 ],
  'sw' => [ -1, -1 ],
  'se' => [ 0, -1 ],
  'nw' => [ 0, 1 ],
  'ne' => [ 1, 1 ],
}.freeze

#

gurgeous

# append to data
data += (data.max + 1..1000000).to_a
max = data.max

#
# build cups/lookup from data
#

Node = Struct.new(:value, :next)

gurgeous

players = data.split("\n\n").map do |s|
  s.lines[1..].join.ints
end

# part 1
loop do
  top = players.map(&:shift)
  (top[0] > top[1]) ? players[0] += top : players[1] += top.reverse
  if loser = players.find_index(&:empty?)
    p players[1 - loser].reverse.map.with_index { |c, ii| c * (ii + 1) }.sum