Posts by 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 ...
brainfuck, 31 bytes ++++++++++[[>]>-[<+>---]<[.<]>] Try it online!
Bash, 17 bytes echo x$1;./$0 x$1 Try it online! Thanks to celtschk for spotting my mistake :)
Python 3, 49 bytes lambda m,n:[[*range(n*_,n*_+n)]for _ in range(m)] Try it online!
Python 2, 46 bytes lambda m,n:[range(n*_,n*_+n)for _ in range(m)] Try it online!
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}$.
