0
Given a ragged list, we can define an element's depth as the number of arrays above it, or the amount that it is nested.
For example, with the list [[1, 2], [3, [4, 5]]] the depth of the 2 is 2, as it is nested within two lists: The base list, and the list [1, 2]. The depth of the 4 is 3 as it is...
Vyxal 2.7.2 to 2.11.1 (safe, patched in v2.11.2)
Yet another ACE in Vyxal.
Commands with randomness aren’t allowed, and neither are EĖ†. Info is in the repo.
Explanation:
The exponential generating function (e.g.f.) of a sequence \$a_n\$ is defined as the formal power series \$f(x) = \sum_{n=0}^{\infty} \frac{a_n}{n!} x^n\$.
When \$a_0 = 0\$, we can apply the exponential function \$\exp\$ on this formal power series:
\$\begin{align}
\exp(f(x)) &= \sum_{n=0}^{\inft...
Move n, out n
Your task is to write a code, where if you move n adjacent characters, the program has to output n.
The code has to work for all integer n's \$0 \le n < \text{code-size}\$
The winning-criteria is code-golf
Rules
Code length has to be greater than 1
Code size is not measured by byte...
