=
⁽æṅ
›››
../././
5
6
7
8
9
↵↵
11
IIIIIIIIIIIII$IIO
ǎǎǎ
⇩⇩⇩⇩⇩⇩⇩ȧ
qqqqḟ
₈√
⁺#⁺o⁺∨ḭḭ⁺o⁺∨ḭḭ⁺o⁺∨ḭḭ
\røA
uu-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-
»¢»
`꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍```꘍
22
ðǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏL
EEE¡
bbbbbbS₅
₄
⁼TTT
¬ṗṗ∑∑ṗṗ∑∑ṗṗ∑∑ṗṗ∑∑∑∑ṗṗ∑∑ṗṗ∑∑∑
≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"ṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠ↑
₀₀+₀+
ẏmmmmmẏG
⌐ddddd
33
⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
ċ?ċḋ¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦ṫ
≥YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYÞMg
₇₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇•
‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹N
kRʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘi
∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ
ėfėfėfėfėfėfėfėfṁ⌊
≈⁰⁰≈⁰⁰≈⁰≈WB
44
⟨a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a⟩żt
₆Ḃ
₁ɽy_yyyy_yġ
‛JJ‛QQ‛QQJJ‛QJβ
«ƈ«HʀṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪƒD
c½½½½½½ĖḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢh
Try it Online!
I just had to one-up 05AB1E and Jelly.
Explanations
1-10
=
Vyxal pads the stack with 0s, so this runs 0 == 0 which is 1.
⁽æṅ
ṅ finds the first integer that satisfies a predicate, the predicate in this case being primality (æ), so this finds the first prime, 2.
›››
Increments (›) 0 three times to get 3.
../././
. on its own is 0.5, so this is 0.5/0.5/0.5/0.5 = 4.
5 to 9 are just normal integers.
↵↵
↵ takes 10 to the power of a number, so this takes 10 ** (10 ** 0) = 10 ** 1 = 10.
11-20
11
Just the number 11.
IIIIIIIIIIIII$IIO
I is a builtin that, given a string, unevaluates it and prepends it to the original. When given an integer, it outputs that many spaces, so the first I results in the empty string and the other 12 result in a massive 500kB string. Then, $II results in ``, and O counts how many times that occurs in the previous string, which happens to be 12.
ǎǎǎ
ǎ when given a number n returns the nth prime, so this results in 2, the 0th prime; 5, the second prime; and finally 13, the 5th prime.
⇩⇩⇩⇩⇩⇩⇩ȧ
⇩ subtracts 2 from a number, and this subtracts 2 7 times from 0 to result in -14, then ȧ (absolute value) turns it into 14.
qqqqḟ
q unevaluates a string, so repeating it four times gives 0 -> "0" -> "\"0\"" -> "\"\\\"0\\\"\"" -> "\"\\\"\\\\\\\"0\\\\\\\"\\\"\"". ḟ finds the first index of a 0 in this last string, which is 15.
₈√
₈ pushes 256, √ takes the square root which is 16.
⁺#⁺o⁺∨ḭḭ⁺o⁺∨ḭḭ⁺o⁺∨ḭḭ
⁺ before a single character pushes 101 + that char's index in the codepage - in particular, ⁺# is 136, ⁺o is 212, and ⁺∨ is 106. ḭ is floor division, and this calculates 136 / (212/106) / (212/106) / (212/106) = 17.
\røA
øA finds the index of a letter in the alphabet, and r is the 18th letter of the alphabet so this returns 18.
uu-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-u-
u pushes -1, so u- subtracts -1 from a number, incrementing it. This increments -1 20 times to result in 19.
»¢»
This is a compressed number that evaluates to 20.
21-30
`꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍꘍```꘍
꘍ calculates the Levenshtein distance between two strings, and this calculates the Levenshtein distance between obgobgobgobgobgobgobg and the empty string, which is 21.
22
Just a plain old number literal.
ðǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏL
ð pushes a space, and Ǐ appends the first character of a string to itself, so repeating Ǐ 22 times results in a 23-character string which L then takes the length of.
EEE¡
E raises 2 to the power of its input, so EEE results in 2^(2^(2^0)) = 2^(2^1) = 2^2 = 4, then ¡ takes the factorial to result in 24.
bbbbbbS₅
b, given an integer, returns its binary representation as a list. When given 0, it returns ⟨ 0 ⟩, and using it six times gives ⟨ ⟨ ⟨ ⟨ ⟨ ⟨ 0 ⟩ ⟩ ⟩ ⟩ ⟩ ⟩, which is then stringified with S and ₅ takes the length, which is 25.
₄
₄ is a builtin that pushes 26.
⁼TTT
⁼ is nonvectorising equality, and given 0 and 0 it spits out 0 == 0 which is 1. T triples a number, and tripling 1 three times gives 27.
¬ṗṗ∑∑ṗṗ∑∑ṗṗ∑∑ṗṗ∑∑∑∑ṗṗ∑∑ṗṗ∑∑∑
¬ is logical not, and when given 0 returns 1. ṗ takes all subsets of a list, and ∑ sums a list. Given a singleton list containing an integer [n], one ṗ results in [[], [n]], another results in [[], [[]], [[n]], [[], [n]]], and then two calls to ∑ result in [2n]. So, ṗṗ∑∑ doubles an integer. Here, 1 is doubled 4 times to 16, then its digits are summed to 7, then it's doubled twice to 28.
≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"≤"ṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠṠ↑
≤ is less-than-or-equal-to, and " pairs two values. The first ≤" results in [0, 1], then the second gives [0, [1, 1]], and so on 20 times. Then, Ṡ sums each item of this. The first gives [0, [2, [2, ...]]], the second gives [0, [4, [4, ...]]], and so on until the second-to-last results in [0, 524288]. One final Ṡ sums the digits of each of these, giving [0, 29], then ↑ takes the maximum.
₀₀+₀+
₀ pushes 10, + is addition, so this calculates 10+10+10=30.
31-40
ẏmmmmmẏG
ẏ takes a list [a_0, a_1, ... a_n] and returns [0, 1, ... n]. Given 0, it returns [0]. m mirrors a list, appending its reverse to itself, and applying m 5 times results in a list of 32 0s. Then, ẏ turns this into [0, 1, ... 30, 31], and G takes the maximum, 31.
⌐ddddd
⌐ takes the one's complement of 0, 1, then d doubles it five times to get 32.
33
Just a plain integer literal.
⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧⇧
⇧ increases a number by 2, and this increases 0 by 2 17 times to result in 34.
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
! pushes the length of the stack, so running it 36 times pushes 0, 1, 2 ... 35, and the top is implicitly output.
ċ?ċḋ¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦¦ṫ
ċ returns 1 if its input is not 1, so this pushes two 1s, divmods them with ḋ to result in [1 / 1, 1 % 1] = [1, 0]. Taking the cumulative sum of this 36 times results in [1, 1], then [1, 2], and eventually [1, 36]. ṫ grabs the final element.
≥YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYÞMg
≥ creates a 1, then each Y interleaves an implicit [0] and the current list, resulting in a 38-item list with a 1 at the end. ÞM finds the indicies of maximal elements, i.e. the single index of that 1, which is 37, and g extracts that from the list.
₇₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇*₇•
₇ is the constant 128. * is multiplication, so this multiplies 128 by itself 38 times to get 128^38. Then, • is used to take the base-128 logarithm, yielding 38.
‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹N
‹ decrements a number, and this decrements 0 39 times to get -39, before negating it with N to get 39.
kRʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘiʁṘi
It's the big one. kR is the constant 360, and ʁṘi is a very inefficient decrement - generate the range [0, n), reverse it, and index an implicit 0 into it to get the first item n-1. This decrements 360 320 times to get 40.
41-50
∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ∆Ṗ
∆Ṗ is a builtin that finds the next prime after the input value. By using it 12 times we get the 12th prime, 41.
ėfėfėfėfėfėfėfėfṁ⌊
ė zips a list with its indices, and f flattens the list. Applying it once gives [0, 0], again gives [0, 0, 0, 1], a third time gives [0, 0, 0, 1, 0, 2, 1, 3], eventually leading to a 256-item-long list. ṁ takes the mean of this, which is 42.16, and ⌊ floors that to 42.
≈⁰⁰≈⁰⁰≈⁰≈WB
⁰ pushes the first input, which defaults to 0, and ≈ checks if all items of something are the same, returning 1 when given 0. This pushes 1, 0, 1, 0, 1, 1 to the stack, wraps the stack in a list with W, then converts it from binary with B.
44
Just another number literal.
⟨a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a|a⟩żt
⟨a|a|a|...⟩ is a literal for a list of 0s 45 items long. ż then takes this list and generates the range [1, 2, 3... 45], and t takes the last item of this, 45.
₆Ḃ
₆ pushes the constant 64, and Ḃ reverses this to give 46.
₁ɽy_yyyy_yġ
₁ is the constant 100, and ɽ turns this into the range [1, 2, 3, ... 99]. y is a builtin that uninterleaves a list, pushing every second item and then the rest, so a combination of y (choose second half) and y_ (choose first half) are used to arrive at the list [47]. ġ then takes the gcd of this, which is 47.
‛JJ‛QQ‛QQJJ‛QJβ
‛xy pushes the string xy, so this pushes JJ, QQ, QQ and then concatenates them with J into JJQQQQ. Then, QJ is used as a key to convert the integer from base 2 with β, with Js representing 1s and Qs representing 0s, resulting in 48.
«ƈ«HʀṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪṪƒD
«ƈ« is the compressed string aa. H converts this from hexadecimal to 170, then ʀ converts this to [0, 1, 2, ... 170]. Then, Ṫ is used 121 times to remove the last 121 items of the list, leaving [0, 1, 2, ... 49]. Finally, ƒD reduces this by an identity function to yield the last item, 49.
c½½½½½½ĖḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢḢh
c checks whether 0 contains 0, giving 1. ½ is used six times to divide this by 64, then Ė takes the reciprocal of this, giving 64. The first Ḣ converts this to [2, 3, 4 ... 64], then the remaining 48 remove the first 48 items to yield [50, 51, ... 64]. h gets the first item of this, 50.
#include <iostream>and other boilerplate stuff in C++. You do needfrom numpy import *. Note: I'm not a programmer, so I don't know all the nuances. We can discuss in chat if something is unclear :) \$\endgroup\$