Source: Grid Computing
Part 1: You are given a grid of nodes and the output of the df command telling you how much space is on each. How many pairs of nodes are there where the data from some node
Awould fit entirely onB?
Part 1: You are given a grid of nodes and the output of the df command telling you how much space is on each. How many pairs of nodes are there where the data from some node
Awould fit entirely onB?
Part 1: Another virtual machine, of sorts. Start with the string
abcdefghand apply a sequence of the following commands to it:
- swap position
Xwith positionY= swap two positions- swap letter
Xwith letterY= swap to letters, no matter where they are- rotate (left|right)
Xsteps = rotate forward or backward- rotate based on position of letter
X= findX, rotate right based on its position; if the original position was >= 4, rotate one more1- reverse positions
XthroughY= reverse a subset of the string- move position
Xto positionY= take a character at a position out of the string and put it somewhere else specific
Part 1: Given a list of integer ranges (a la
5-8), what is the first value not in any given range?
Part 1: Create a circular list of the numbers
1throughn. Going around the list, each currently remaining number removes the number after it. What is the last remaining number?
Part 1: Starting with a sequence of
.and^, generate additional rows using the rules based on the three characters above the new position.
^^.->^.^^->^^..->^..^->^- Otherwise ->
.
How many safe tiles (
.) are there after 40 generations?
Part 1: Create a 4x4 grid of rooms with doors
Up,Down,Left, andRight from each location. To determine if a door is currently open:
- Calculate
MD5(salt + sequence)where sequence is a string containing any combination ofUDLRdepending on how you got to this room- The first four hex values represent the doors
Up,Down,Left, andRight respectively:bcdefmeans open; anything else is closed
Find the shortest path from
(0, 0)to(3, 3).
Part 1: Generate noise using a modified dragon curve:
- Start with data
a- Create a copy of the data
b, reverse and invert it (0 <-> 1)- Create the string
a0b
Repeat until you have enough data, truncate at the end if needed.
From this string calculate a checksum as follows:
- xor each pair of bits, concatenate the results
- If the resulting string has an even length, repeat; if it’s odd, stop
Calculate the checksum of a given initial state expanded to
272bits.
Part 1: Given a series of openings one second apart, each with
npositions that advance one position per second, what is the first time you can start the simulation so that you pass each in position0.
Part 1: Calculate a series of MD5 hashes (the same as Day 5). A hash is considered valid if it contains a triple (three characters in a row) and somewhere in the next 1000 hashes there is a quintuple of that same character.
What index produces the 64th key?
Part 1: Generate a procedurally generated maze using the following equation:
- x^2 + 3x + 2xy + y + y^2 + c
xandyare the coordinates of a point andcis a constant.
Count the number of bits for each point. Even is open spaces, odd is walls.
What is the shortest route from
(0, 0)to(31, 39)?