Here's my annotated version (the two input bytes are b and a, their sum is c): -[-[->+- *32* from dot org/wiki/Brainfuck_constants#32 The TIO link has the 11 test case because I couldn't figure out how to type the null character into a web browser, but if you delete the second input character it will do the same thing as the 10 test-case, and if you delete both it will be the same as the 00 test-case. Takes input as two bytes (0 or 1) on stdin, outputs space-separated to stdout without trailing whitespace. “×®ṫ.¡Ḍẹhɗ» - compressed string "NOR NAND XNOR" "NOR NAND XNOR" "NOR NAND XNOR" Μ - start a new monadic link, call that X Furthermore \$\lfloor \frac \rfloor = 5\$. When one-indexed the sum \$1\$ needs characters 1 and 11 removed while the sum \$2\$ one needs characters 1 and 5 removed. Observe that there are three outputs, aligning with the sums and that the sum \$1\$ and sum \$2\$ outputs are the sum \$0\$ one missing certain characters. A monadic Link accepting a list of two integers (in ) which yields a list of characters - the gate names separated by spaces.
0 kommentar(er)
