Challenge
Print the numbers:
1
22
333
4444
55555
666666
7777777
88888888
999999999
In that order.
I/O
Takes no input. The numbers can have any delimiters desired (or none). That includes lists, cell arrays, .jpeg, etc.... Example outputs:
122333444455555666666777777788888888999999999
[1,22,333,4444,55555,666666,7777777,88888888,999999999]
etc....
Code Example
This is an un-golfed example that may perhaps act as algorithm guide (or maybe not):
Turing Machine Code, 535 bytes
0 * 1 r L
L * _ r 2
2 * 2 r a
a * 2 r M
M * _ r 3
3 * 3 r b
b * 3 r c
c * 3 r N
N * _ r 4
4 * 4 r d
d * 4 r e
e * 4 r f
f * 4 r O
O * _ r 5
5 * 5 r g
g * 5 r h
h * 5 r i
i * 5 r j
j * 5 r P
P * _ r 6
6 * 6 r k
k * 6 r l
l * 6 r m
m * 6 r n
n * 6 r o
o * 6 r Q
Q * _ r 7
7 * 7 r p
p * 7 r q
q * 7 r r
r * 7 r s
s * 7 r t
t * 7 r u
u * 7 r R
R * _ r 8
8 * 8 r v
v * 8 r w
w * 8 r x
x * 8 r y
y * 8 r z
z * 8 r A
A * 8 r B
B * 8 r S
S * _ r 9
9 * 9 r C
C * 9 r D
D * 9 r E
E * 9 r F
F * 9 r G
G * 9 r H
H * 9 r I
I * 9 r J
J * 9 r halt
This prints out the numbers with a space delimiter:
1 22 333 4444 55555 666666 7777777 88888888 999999999
Challenge Type
code-golf, so shortest answer in bytes (by language) wins.
Based on a submission in the sandbox.
-
2\$\begingroup\$ Can the delimeters be numbers? \$\endgroup\$Wheat Wizard– Wheat Wizard ♦2020年03月17日 17:16:30 +00:00Commented Mar 17, 2020 at 17:16
-
\$\begingroup\$ @AdHocGarfHunter, No. Good catch. Edit: Actually, I think '0' should be acceptable. \$\endgroup\$ouflak– ouflak2020年03月17日 17:17:23 +00:00Commented Mar 17, 2020 at 17:17
-
\$\begingroup\$ Could you verify that they "strange delimiters" version of this answer, is valid? It definitely seems cheaty. \$\endgroup\$Wheat Wizard– Wheat Wizard ♦2020年03月17日 17:32:14 +00:00Commented Mar 17, 2020 at 17:32
-
\$\begingroup\$ Honestly I think it's a clever 'outside-of-the-box' solution. I'd upvote, but I'm out of votes until tomorrow. \$\endgroup\$ouflak– ouflak2020年03月17日 17:35:49 +00:00Commented Mar 17, 2020 at 17:35
-
4\$\begingroup\$ @ouflak Thanks for the algorithm guide! How did you know I always write my prototypes with Turing Machines :p \$\endgroup\$AviFS– AviFS2020年03月19日 01:01:33 +00:00Commented Mar 19, 2020 at 1:01
122 Answers 122
Google Sheets, 35 bytes
=ArrayFormula(Rept(Row(1:9),Row(1:9
Sheets will automatically add three trailing parentheses when you exit the cell. Output is one line per row.
05AB1E, 3 bytes
×ばつ
9L Build a list from 1 to 9 {1, 2, 3, 4, 5, 6, 7, 8, ×ばつ copy each number that many times
Bash + Core utilities, (削除) 27 (削除ここまで), 25 bytes
seq -f8d%f*7-v1+2/n 45|dc
Changed seq formatting from %0.f to %f for a 2-byte savings.
Modified to print on one line, with no delimiters, instead of having a newline after each number, just because I like that better. Same number of bytes.
This uses the formula $$\left\lfloor\frac{\big\lfloor\sqrt{8n-7}\big\rfloor+1}2\right\rfloor$$
for the \$n^{th}\$ digit, where \$n\$ goes from 1 to 45.
-
\$\begingroup\$ Hmm, I may be out of date but isn't the usual ruling that it needs cat() or equivalent to print the output? \$\endgroup\$user2390246– user23902462020年03月17日 16:44:38 +00:00Commented Mar 17, 2020 at 16:44
-
1\$\begingroup\$ @user2390246 yeah, the consensus was changed...a while ago? Late 2017 by my quick search of meta. This is probably what you're aware of but taking that approach with this meta post on compiler flags basically means all R answers are just "R invoked with
source(...,echo=TRUE)" \$\endgroup\$Giuseppe– Giuseppe2020年03月17日 18:44:47 +00:00Commented Mar 17, 2020 at 18:44 -
\$\begingroup\$ @Giuseppe thanks for the clarification, I've not been around for a while! Seems like the trend for cat()-type answers ended up being quite a short phase then. \$\endgroup\$user2390246– user23902462020年03月17日 19:33:09 +00:00Commented Mar 17, 2020 at 19:33
-
\$\begingroup\$ Beat you with a string-only approach! :-) \$\endgroup\$Giuseppe– Giuseppe2020年03月18日 19:07:53 +00:00Commented Mar 18, 2020 at 19:07
-
\$\begingroup\$ @Giuseppe Ooh, nice! \$\endgroup\$Robin Ryder– Robin Ryder2020年03月18日 19:16:35 +00:00Commented Mar 18, 2020 at 19:16
APL (dzaima/APL), 6 bytes
Full program, requiring ⎕IO←0.
⍋⍛⌿⍨⎕D
⎕D on the string "0123456789",
⍛⌿⍨ replicate the characters by
⍋ their grade (0, 1, 2, ..., 9)
-
\$\begingroup\$ Isn't
\⍨⍳9at 4 bytes sufficient? I've added it as my own answer, though it doesn't seem to be gaining any traction. Would love feedback! \$\endgroup\$AviFS– AviFS2020年03月19日 00:58:17 +00:00Commented Mar 19, 2020 at 0:58 -
\$\begingroup\$ @AviF.S. It wasn't clear that this was a permitted format, but now that OP has clarified, you have my upvote. \$\endgroup\$Adám– Adám2020年03月19日 06:52:13 +00:00Commented Mar 19, 2020 at 6:52
APL (Dyalog Unicode), 4 bytes
\⍨⍳9
How it works
⍳9 ⍝ Integers 1..9
⍨ ⍝ Duplicate argument on each side
\ ⍝ Replicate each element *n* times
Examples
Index Generator: ⍳5 = 1 2 3 4 5
Expand: 2 3 \ 1 4 = 1 1 4 4 4
Commute: +⍨4 = 4 + 4 = 8
-
\$\begingroup\$ Feedback: I'd use
/⍨⍳9as it is simpler./is really "replicate" while\is the more complex "expand". \$\endgroup\$Adám– Adám2020年03月19日 06:53:39 +00:00Commented Mar 19, 2020 at 6:53
brainfuck, 56 bytes
+++++++[>+++++++<-]+++++++++[<+[>>.<<-<+>]<[>+<-]>>>+<-]
+++++++[>+++++++<-] 49 (ASCII "1")
+++++++++[ do 9 times
<+ add 1 to output counter
[ do that many times
>>.<< print character
-<+> move value of output counter to temp
]
<[>+<-] move value of temp back to output counter
>>>+ increment character
<- decrement loop counter
]
-
1
-
2\$\begingroup\$ Thank you. Your code is so different from mine, you should post it as a separate answer. \$\endgroup\$Dorian– Dorian2020年03月17日 13:27:06 +00:00Commented Mar 17, 2020 at 13:27
Retina, 12 bytes
9*
$.`*$.`
Try it online! Outputs a leading _ to each number, which appears to be acceptable (would cost 2 bytes to fix if not). Explanation:
9*
Insert 9 _s.
$.`*$.`
Around each _, insert its position repeated appropriately.
-
\$\begingroup\$ The leading
_is absolutely acceptable. \$\endgroup\$ouflak– ouflak2020年03月17日 11:31:43 +00:00Commented Mar 17, 2020 at 11:31
APL (Dyalog Unicode), 7 bytesSBCS
⎕D/⍨⍳10
Uses ⎕IO←0.
How it works
⎕D/⍨⍳10
⎕D ⍝ The string '0123456789'
/⍨ ⍝ Replicate each of them the following times...
⍳10 ⍝ 0..9
Brain-Flak, (削除) 90 (削除ここまで) 82 bytes
([(()()())({}){}]){((({})()<([{}]((((()()()){}){}){}){})>)<{({}()<(({}))>)}{}>)}{}
Explanation:
Compare this with the output of JoKing's autogolfer
Brain-Flak, 142 bytes
(((((((((((((((((((((((((((((((((((((((((((((((((()()()){}){}){}){}())()))())))()))))())))))()))))))())))))))()))))))))()))))))))){({}<>)<>}<>
Strange delimiters, 78 bytes
([(()()())({}){}]){((({})()<([{}]((((()()()){}){}){}){})>)<{({}()<(({}))>)}>)}
If we decide to play around with our delimiters a bit, we can shave off 4 bytes. This version outputs the correct stuff but with two leading null bytes and null bytes between the chunks:
This is a tiny bit cheaty but it meets the specs of the challenge.
And for posterity here is the old super cheaty version that has been made obsolete by my golfs.
-
\$\begingroup\$ Welcome to Code Golf! \$\endgroup\$2022年09月08日 13:34:19 +00:00Commented Sep 8, 2022 at 13:34
-
\$\begingroup\$ Thank you a lot! :) \$\endgroup\$Calga– Calga2022年09月09日 11:57:10 +00:00Commented Sep 9, 2022 at 11:57
Jelly, 5 bytes
9ẋ`€Ḍ
A niladic link returning a list of integers. If a program printing the numbers is preferred, subsitute Y for Ḍ.
Explanation
9 | Literal 9
ẋ`€ | Repeat each that many times
Ḍ | Convert from decimal digits to integer
-
1\$\begingroup\$ You can drop the trailing
Ḍ, based on the comments below the challenge description between xnor and OP. \$\endgroup\$Kevin Cruijssen– Kevin Cruijssen2020年03月18日 15:37:55 +00:00Commented Mar 18, 2020 at 15:37
-
1\$\begingroup\$ Just
rep(1:9,1:9)is shorter (and gives exactly the output of the first example)? \$\endgroup\$Dominic van Essen– Dominic van Essen2020年06月24日 22:50:48 +00:00Commented Jun 24, 2020 at 22:50
-
1\$\begingroup\$
,/${x}#!10- using filter ({}#) for replication \$\endgroup\$ngn– ngn2020年03月25日 19:23:01 +00:00Commented Mar 25, 2020 at 19:23 -
\$\begingroup\$ @ngn Thanks, of course! \$\endgroup\$Galen Ivanov– Galen Ivanov2020年03月25日 19:28:31 +00:00Commented Mar 25, 2020 at 19:28
-
1\$\begingroup\$ I think
echo#~1+i.10is ok too since any delimiter is allowed. \$\endgroup\$Jonah– Jonah2022年01月03日 04:50:14 +00:00Commented Jan 3, 2022 at 4:50
-
\$\begingroup\$ can't be called twice \$\endgroup\$l4m2– l4m22020年04月22日 16:13:29 +00:00Commented Apr 22, 2020 at 16:13
-
\$\begingroup\$ Thanks for catching that :) \$\endgroup\$dingledooper– dingledooper2020年04月22日 16:18:46 +00:00Commented Apr 22, 2020 at 16:18
x86-16 machine code, IBM PC DOS, (削除) 18 (削除ここまで) 16 bytes
Binary:
00000000: b839 0ab2 09b1 2dcd 1048 2aca 4a75 f8c3 .9....-..H*.Ju..
Listing:
B8 0A39 MOV AX, 0A39H ; AH = 0AH, AL = '9'
B2 0A MOV DL, 10 ; DL as counter value
B1 2D MOV CL, 1+2+3+4+5+6+7+8+9 ; start digit repeat 45 times
NLOOP:
CD 10 INT 10H ; call BIOS - write digit * CX times
48 DEC AX ; decrement ASCII digit
4A DEC DX ; decrement counter value
2A CA SUB CL, DL ; reduce digit repeat value by counter
75 F8 JNZ NLOOP ; loop until 0
C3 RET ; return to DOS
Explanation:
This uses the PC BIOS API's INT 10H / 0AH function to write the ASCII char in AL to the screen CX number of times. However, this function does not update the cursor position to the end of the output -- it just stays where it started. In other words, the next call simply overstrikes existing characters writing over them. Making a BIOS call to advance the cursor is expensive byte-wise.
Since going forward isn't going to work, we go backwards starting from '9'. It writes '9' 45 times, then '8' 36 times, '7' 28 times, etc -- each time starting from the first column overwriting like so:
999999999999999999999999999999999999999999999
888888888888888888888888888888888888999999999
777777777777777777777777777788888888999999999
666666666666666666666777777788888888999999999
555555555555555666666777777788888888999999999
444444444455555666666777777788888888999999999
333333444455555666666777777788888888999999999
222333444455555666666777777788888888999999999
122333444455555666666777777788888888999999999
Output:
Java 11 (JDK), (削除) 60 (削除ここまで) 59 bytes
Not sure if thats the shortest approach but couldn`t make it shorter even without System.out.print. Output is without delimiters.
-1 byte thanks to Kevin Cruijssen
v->{for(int i=0;i++<9;System.out.print((i+"").repeat(i)));}
-
1\$\begingroup\$ You can save 1 byte changing the
()->tov->, by taking an empty unused (Void null) argument, which is allowed when it's completely unused. \$\endgroup\$Kevin Cruijssen– Kevin Cruijssen2020年03月18日 10:04:18 +00:00Commented Mar 18, 2020 at 10:04 -
\$\begingroup\$ @Kevin Cruijssen Thanks for the suggestion, didn't know about that. I now use an Object as parameter and pass null, is this the intended way or can you actually do it with Void? \$\endgroup\$greinet– greinet2020年03月18日 10:26:03 +00:00Commented Mar 18, 2020 at 10:26
-
\$\begingroup\$
Object nullis fine as well. As long as the argument isn't used in any way, not even for static calls, it's ok. That's why I personally useVoid, since it has no available static calls anyway. :) \$\endgroup\$Kevin Cruijssen– Kevin Cruijssen2020年03月18日 10:27:58 +00:00Commented Mar 18, 2020 at 10:27 -
\$\begingroup\$ Well thats awkward, could've sworn that it just didn't compile with type
Void, changed it again and now it works, thanks. \$\endgroup\$greinet– greinet2020年03月18日 10:32:33 +00:00Commented Mar 18, 2020 at 10:32
Haskell, 21 bytes
[c<$[1..c]|c<-[1..9]]
A list of lists of numbers.
23 bytes
replicate<*>id=<<[1..9]
A flat list of numbers.
-
\$\begingroup\$ I think that the delimiter has to be in between differing digits (e.g.
1and2as opposed to8and another8). \$\endgroup\$2020年03月17日 18:06:11 +00:00Commented Mar 17, 2020 at 18:06 -
\$\begingroup\$ @AdHocGarfHunter Looking again at the challenge, I'm not clear on this so I asked. I think it would be unfortunate if the flat list in the second version were invalid too. \$\endgroup\$xnor– xnor2020年03月17日 18:14:28 +00:00Commented Mar 17, 2020 at 18:14
Julia, 22 bytes
1:9 .|>i->show("$i"^i)
prints
"1""22""333""4444""55555""666666""7777777""88888888""999999999"
Relying on the repl for printing output we can get to 17 bytes
~i="$i"^i;.~(1:9)
Deadfish~, 194 bytes
{{i}ddddd}dc{d}{d}iiic{i}{i}ddcc{d}{d}iic{i}{i}dccc{d}{d}ic{i}{i}cccc{d}{d}c{i}{i}iccccc{d}{d}dc{i}{i}iicccccc{d}{d}ddc{i}{i}iiiccccccc{d}{d}dddc{i}{i}iiiicccccccc{d}{d}ddddc{i}{i}iiiiiccccccccc
-
\$\begingroup\$ Understandable. \$\endgroup\$2021年06月12日 11:38:45 +00:00Commented Jun 12, 2021 at 11:38
-
\$\begingroup\$ @lyxal ???? (filler) \$\endgroup\$avarice– avarice2021年06月12日 11:39:37 +00:00Commented Jun 12, 2021 at 11:39
-
\$\begingroup\$ @wasif the reason it was accepted \$\endgroup\$2021年06月12日 11:40:54 +00:00Commented Jun 12, 2021 at 11:40
-
1
-
1
-
\$\begingroup\$ Nice code. Sometimes I wonder how well T-SQL would do in these challenges if we had a built-in number table or some equivalent to PostgreSQL's
generate-series()function. \$\endgroup\$BradC– BradC2020年05月26日 15:48:03 +00:00Commented May 26, 2020 at 15:48 -
1\$\begingroup\$ @BradC normally SQL will not win in these golfing questions even with improved features. When we use a command like replicate(a,b), some of the other languages can solve problem with fewer characters than the 14 characters(minimum) it takes to call that function. The best we can do it solve the problems using a language which usually isn't optimal, and hope some people are impressed enough to up-vote those solutions. \$\endgroup\$t-clausen.dk– t-clausen.dk2020年05月27日 11:29:13 +00:00Commented May 27, 2020 at 11:29
Charcoal, 5 bytes
⭆χ⭆ιι
Try it online! Link is to verbose version of code. Outputs without separators. The first StringMap could be changed into a for statement for the same byte count. Explanation:
χ Predefined variable 10
⭆ Map over implicit range and join
ι Current index
⭆ Map over implicit range and join
ι Outer index
Implicitly print