Part 1: Create a 128x128 grid. Generate each row by taking the knot hash of
salt-{index}. The bits of the hash represent if a tile in the grid isfree(0) orused(1).
Given your salt as input, how many squares are
used?
Part 1: Multiple layers are defined with rules of the form:
- {index}: {depth}
Each layer will start at position 0, then once per tick will advance towards depth. Once it hits
depth-1, it will return to position 0, taking2*depth-1per full cycle.
Calculate the sum of
index * depthfor any scanners that are at position0when you pass through them given an initial starting time.
On of the advantages of working in computer programming is that I can work from anywhere I have a computer and an internet connection. One of the disadvantages is that many of the resources that I need to do my job are locked to only be accessible within a specific network (albeit with a bastion host).
I long ago set up my SSH config to create an SSH tunnel and I can proxy many applications through that just by setting the HTTP_PROXY and/or HTTPS_PROXY environment variables. The downside of this though is that if I’m actually on a ‘safe’ network, there’s no reason to use the bastion host and I would actually be putting extra load on it.
My goal: write something that would let me automatically proxy applications when I need to but not when I don’t.
Part 1: A network of nodes is defined by a list of lines formatted as such:
2 <-> 0, 3, 4
Whenever I create my yearly reading list, I need a way to order the books. Sure, I could just shuffle them normally, but that leads me to the temptation of cheating and re-shuffling them so that the books I want to read most are first. What I really need is a shuffle that will shuffle the same way every time.
Enter: hashsort
Part 1: Starting with a list of the numbers from
1tonand a list oflengths(as input):
- Initialize
current_positionandskip_sizeto0- For each
lengthelement in thelengthslist:- Reverse the first
lengthelements of the list (starting atcurrent_position)- Move forward by
lengthplusskip_size- Increment
skip_sizeby 1
After applying the above algorithm, what is the product of the first two elements in the list (from the original first position, not the
current_position)?
A long time ago1, in a galaxy far, far away2, I moved my blog from WordPress to a custom written static blog generator in Racket. And for a while, all was well.
Part 1: An input stream can contain:
groupsare delimited by{and},groupsare nestable and may containgarbageor data (objects within agroupare comma delimited)garbageis delimited by<and>,groupscannot be nested withingarbage, a!withingarbageis an escape character:!>does not end a garbage segment
The score of a single group is equal to how many times it is nested (the innermost group of
{{{}}}has score3).
The score of a stream is the sum of the scores of all groups in that stream.
What is the total score of your input?
Part 1: Given a set of registers initialized to 0, interpret a series of instruction of the form:
{register} (inc|dec) {number|register} if {number|register} (<|<=|=|!=|=>|>) {number|register}
What is the largest value in any register?