Activity for orthoplex‭

Type	On...	Excerpt	Status	Date
Answer	—	A: From the smallest seed HQ9+, 2 bytes Two quines. QQ (more)	—	almost 2 years ago
Answer	—	A: Create a range grid [Python 2], 46 bytes lambda m,n:[range(n,n+n)for in range(m)] Try it online! (more)	—	about 2 years ago
Answer	—	A: Create a range grid [Python 3], 49 bytes lambda m,n:[[range(n,n+n)]for in range(m)] Try it online! (more)	—	about 2 years ago
Answer	—	A: Looping counter [Ruby], 18 bytes loop{$><<$/=?+$/} Try it online! (more)	—	about 2 years ago
Answer	—	A: Looping counter [brainfuck], 31 bytes ++++++++++[[>]>-[---]] Try it online! (more)	—	about 2 years ago
Answer	—	A: Looping counter [><>], 10 bytes 1:naoa1+! Try it online! (more)	—	about 2 years ago
Answer	—	A: Looping counter [dc], 13 bytes [r1+pArdx]dx Try it online! (more)	—	about 2 years ago
Answer	—	A: Looping counter [Bash], 17 bytes echo x$1;./$0 x$1 Try it online! Thanks to celtschk‭ for spotting my mistake :) (more)	—	about 2 years ago
Answer	—	A: Looping counter [Python 2], 26 bytes =1 while 1:=10;print- Try it online! (more)	—	about 2 years ago
Answer	—	A: Looping counter [Python 3], 28 bytes ="" while 1:+="";print() Try it online! (more)	—	about 2 years ago
Answer	—	A: It's Hip to be Square [dc], 9 bytes ?dvd-^p Try it online! Comparisons are expensive in dc, so you have to get a bit creative. I came up with $0^{n-\lfloor\sqrt{n}\rfloor^2}$. (more)	—	over 2 years ago
Answer	—	A: Make my value binary [dc], 4 bytes 2o?p Try it online! (more)	—	over 2 years ago
Answer	—	A: Can you give me half? dc, 3 unique bytes, 138 bytes This challenge is pretty easy if you aim for just 4 unique bytes. For example, you could push the stack depth repeatedly to get ascending integers, set the precision to something positive, divide and then print. ```dc zzzzk/p ``` And surely it can't go any lower, ... (more)	—	over 2 years ago