| Bytes | Lang | Time | Link |
|---|---|---|---|
| 070 | AutoHotkey v2 | 241212T112330Z | Xuesong |
| 072 | ><> Fish | 240926T202404Z | value1 |
| 025 | Bash | 231129T180121Z | matteo_c |
| 065 | /// | 221215T221204Z | Fmbalbue |
| 036 | Julia 1.0 | 221215T140832Z | MarcMush |
| 018 | Raku | 221207T225719Z | Jo King |
| 005 | 05AB1E | 221208T174010Z | The Thon |
| 013 | Retina | 221208T012956Z | Neil |
| 026 | Ruby | 221208T013700Z | Sisyphus |
| 001 | Charcoal | 221208T012130Z | Neil |
| 048 | Python 3 | 221208T004503Z | Sisyphus |
| 003 | Vyxal | 221207T224045Z | emanresu |
AutoHotkey (v2), 70 bytes
a:=(r:=(n)=>n?"a" r(n-1):"")(A_Args[1])
MsgBox a ":=0,MsgBox('" a "')"
Output when arg is 15:
aaaaaaaaaaaaaaa:=0,MsgBox('aaaaaaaaaaaaaaa')
Port of Sisyphus's answer
><> (Fish), 72 bytes
'.07{o}-1;!?:+0'i::9)$f)+1+0$.
v'0'
v'W'
+f-$~'f'$f1+0.
>'g00r"'l?!;o74.
First challenge answer!
Might not be the absolute most optimised, but I couldn't find any way to optimise it more. I'm assuming this question is still open to new answers, but tell me if that is wrong.
Output when the input is 12:
"r00gc0+:?!;1-}o{70.
The c0 in the code is changed to add up to input number in hex, up to f+f=30. The challenge didn't specify what to do if the input was out of bounds, so I ignored it.
Let me know if there is anything I can improve on!
///, 65 bytes
/9/8*//8/7*//7/6*//6/5*//5/4*//4/3*//3/2*//2/1*//1/0*//*0/9*//0//
Converts decimal to unary.
///, 0 bytes
Takes input as unary. For me, That's cheating.
Julia 1.0, 36 bytes
print('1'^parse(Int,ARGS[]),|>,show)
port of Jo King's answer
will print something like 1111|>show (equivalent to show(1111))
05AB1E, 5 bytes
1¸sиJ
Sort-of port of emanresu A's Vyxal answer:
1¸sиJ # Implicit input STACK:
1¸ # Push ['1'] ['1'], 5
sи # Repeat input number of times ['1', '1', '1', '1', '1']
J # Join by '' '11111'
# Implicit output
Retina, 13 bytes
.+
*KKK
KK
K`
Try it online! Explanation: Outputs a string of length n+2 alternating between K and `. This creates a program in Retina that outputs the part of the string after the K` which is also equal to the first n characters of the program. Retina can also execute the resulting program for you automatically: Try it online! Or see both the program and its output: Try it online!
Ruby, 26 bytes
$><<?1*gets.to_i+'=>x;p x'
Uses the Ruby 3 pattern match syntax to bind the integer to x.
Charcoal, 1 byte
N
Try it online! Port of @Ausername's Vyxal answer. Explanation: Simply outputs n -s; strings of printable ASCII need no delimiter in Charcoal, so as a program, it just prints the string of -s, i.e. itself.