orthoplex‭

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 ...

posted 4y ago by orthoplex‭

Ruby, 18 bytes loop{$><<$/=?*+$/} Try it online!

posted 4y ago by orthoplex‭

brainfuck, 31 bytes ++++++++++[[>]>-[<+>---]<[.<]>] Try it online!

posted 4y ago by orthoplex‭

dc, 4 bytes 2o?p Try it online!

posted 4y ago by orthoplex‭

Python 3, 28 bytes _="" while 1:_+="*";print(_) Try it online!

posted 4y ago by orthoplex‭

Python 2, 26 bytes _=1 while 1:_*=10;print~-_ Try it online!

posted 4y ago by orthoplex‭

Bash, 17 bytes echo x$1;./$0 x$1 Try it online! Thanks to celtschk‭ for spotting my mistake :)

posted 4y ago by orthoplex‭  ·  edited 4y ago by orthoplex‭

dc, 13 bytes [r1+pA*rdx]dx Try it online!

posted 4y ago by orthoplex‭

><>, 10 bytes 1:naoa*1+! Try it online!

posted 4y ago by orthoplex‭

Python 3, 49 bytes lambda m,n:[[*range(n*_,n*_+n)]for _ in range(m)] Try it online!

posted 4y ago by orthoplex‭

Python 2, 46 bytes lambda m,n:[range(n*_,n*_+n)for _ in range(m)] Try it online!

posted 4y ago by orthoplex‭

HQ9+, 2 bytes Two quines. QQ

posted 3y ago by orthoplex‭

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}$.

posted 4y ago by orthoplex‭