The TAK function is defined as follows for integers \$x\$, \$y\$, \$z\$:
$$
t(x, y, z) = \begin{cases}
y, & \text{if $x \le y$} \\
t(t(x-1,y,z), t(y-1,z,x), t(z-1,x,y)), & \text{otherwise}
\end{cases}
$$
Since it can be proved that it always terminates and evaluates to the simple function below,
...
How many ways does this string conform to this expression?
Given an expression, decide in how many ways could an inputted string consisting of only printable ascii conforms to that expression. The best way to explain how the expression works is with an example, so here is one.
Let's say the expre...
How quickly can you type this string?
code-golf string
Given a string consisting of only printable ascii, how many keystrokes are required minimally to type out this string from scratch? The allowed keystrokes are:
one character from printable ascii (1 keystroke)
Ctrl-C any contiguous substring ...
Tile the untileable
Only triangles, squares, and hexagons can tile perfectly with no gaps. With any other polygon, there will always be gaps. But what if you could tile with say, a pentagon? You just have to cheat, with other shapes. Given two integers a and b, how many x-sided polygons where a !...
This is based on a challenge invented by @mousetail.
List the numbers from 1-100 in Roman numerals in the order that minimizes the total sum of the Levenshtein distances between consecutive numbers.
