???, 274 bytes
push=1;
goto 3;
push 100;
line 11 push;
goto 11;
push 10;
pop;
equal 1;
goto 10;
pop 100;
push=80;
push=10;
pu=push;
go=pu+1;
goto 20;
pushe=1;
goto=10;
this=10;
line=19;
NGGYU~~;
push=go;
b=99 max push;
ch=b-68;
goto ch;
Never~/
Gonna/
Give/
You/
Up/
,/
/
goto 02;
100;
HBL, posted by emanresu A
-0/(*(*%*)2)
Try HBL online!
`|\X]- in ASCII/UTF-8 is represented by the bytes 60 7c 5c 58 5d 2d, which represent -0/(*(*%*)2) in HBL's namesake half-byte codepage.
Inspired by this message in TNB, which I'm pretty sure was about his other cop post, but I did a search f...
Alternating sums of multidimensional arrays
code-golf array math
Given a multidimensional array, find the recursive alternating sum. An alternating sum is simply the sum of an array, where every other item is negative. For example, the alternating sum of [7, 1, 6, -4, -2] is the sum of [7, -1, 6...
Implement a function or program that can run simplified BitCycle code. The functions you must implement are:
<^>v: Change the direction of a bit to the direction this is pointing.
+: Turn all 0s left and all 1s right.
\ and /: Reflect one bit 90 degrees, then become inactive. In regular BitCycle,...
Implement a function or program that can run simplified BitCycle code. The functions you must implement are:
<^>v: Change the direction of a bit to the direction this is pointing.
+: Turn all 0s left and all 1s right.
\ and /: Reflect one bit 90 degrees, then become inactive. In regular BitCycle,...
Implement a function or program that can run simplified BitCycle code. The functions you must implement are:
<^>v: Change the direction of a bit to the direction this is pointing.
+: Turn all 0s left and all 1s right.
\ and /: Reflect one bit 90 degrees, then become inactive. In regular BitCycle,...
Given a multidimensional array, find the recursive alternating sum. An alternating sum is simply the sum of an array, where every other item is negative. For example, the alternating sum of [7, 1, 6, -4, -2] is the sum of [7, -1, 6, 4, -2], or 14. In this challenge, you'll take the alternating su...
Whyte Notation Translator
( tags : code-golf, kolmogorov-complexity ? )
Whyte Notation is a classification method mainly for steam locomotive, that classifies by wheel arrangement. On a steam locomotive ( we're only focusing on non articulated locomotives here ), the wheels are generally disposed...
I like golfing in tinylisp:
(d M(q((x)(i x(i(disp x)0(M x))0
But I also like posting explanations with nicely formatted code:
(d M
(q
((x)
(i x
(i (disp x) 0 (M x))
0))))
Can you help me generate the ungolfed code for my explanations?
The task
Given a line of tinylisp code, return...
Longest Possible Pythagorean Triple Triangle
code-golf math arithmetic
A Pythagorean triple is a set of 3 integers \$\{a, b, c\}\$ where \$a^2 + b^2 = c^2\$. Your task is to, given an integer \$n\$ where \$3 ≤ n ≤ 15\$, output a Pythagorean triple using these rules:
If \$n\$ is odd, output \$\{n...
