Turn an integer n into a list containing it n times

Question

Given an integer n as input, return a list containing n, repeated n times. For example, the program would take 5 and turn it into [5,5,5,5,5]. The elements need to be integers, not strings. No built-in functions that accomplish the task are allowed.

This is code-golf, so standard rules apply.

Answer 1

Jelly, 1 byte

x

Try it online!

Note that this is not the “repeat n n times” built-in — its function is more general than that. For example 4,5,6x1,2,3 equals [4, 5, 5, 6, 6, 6]. Given only one argument, Jelly just happens to use it as both the left and right argument for the supplied link, but this functionality is not inherent to x.

If this doesn’t count, there are various fun 2-byte alternatives:

x` ṁ` Ra Rị R» a€ oR oḶ oṬ oẊ Ḷị Ḷ» Ṭị Ṭ» Ẋị Ẋ» ị€ ṛ€ ȧ€ »€

etc.

Answer 2

Python 3, 14 bytes

lambda k:[k]*k

Try it online!

Answer 3

Operation Flashpoint scripting language,  50  46 bytes

f={a=[];t=_this;while{count a<t}do{a=a+[t]};a}

Call with:

hint format["%1", 5 call f]

Output:

Answer 4

APL (Dyalog), 2 bytes

Five equally short solutions. Last two are courtesy of Zacharý.

---

⍴⍨

Try it online!

⍴ cyclically reshape

⍨ self

---

/⍨

Try it online!

/ replicate

⍨ self

---

\⍨

Try it online!

\ expand

⍨ self

---

⌿⍨

Try it online!

⌿ replicate along first (and only) axis

⍨ self

---

⍀⍨

⍀ expand along first (and only) axis

⍨ self

Try it online!

Answer 5

Mathematica, 10 bytes

#~Table~#&

Answer 6

Proton, 8 bytes

n=>[n]*n

Try it online!

Answer 7

JavaScript (ES6), 19 bytes

n=>Array(n).fill(n)

---

Try it

o.innerText=(f=
n=>Array(n).fill(n)
)(i.value=8);oninput=_=>o.innerText=f(+i.value)

<input id=i type=number><pre id=o>

Answer 8

Octave, 12 bytes

@(n)~(1:n)+n

Try it online!

Answer 9

Pyth, 2 bytes

*]

Test suite.

---

*]QQ - Full program with implicit input

 ]   - Turn the input into a list.
*    - Repeat it a number of times equal to the input. 

Answer 10

Haskell, 13 bytes

f n=n<$[1..n]

Try it online! Usage: f 5 yields [5,5,5,5,5]. For n=5, [1..n] yields the list [1,2,3,4,5]. n<$ replaces each element of this list with n.

Answer 11

R, 18 bytes

array(n<-scan(),n)

Try it online!

Answer 12

05AB1E, 2 bytes

Fˆ

Try it online!

Answer 13

Dodos, 76 bytes

	f f r 2
2
	
	
r
	r d
	f s t f
d
	dip f s t
	f
t
	dot f
	dot
s
	s dip
f
	dab

Try it online!

Explanation:

f is an alias for dab (tail).

s is subtraction, as explained on the wiki: (x, y) → (0, y−x) when x ≤ y.

t maps (a, b, c…) to (b+c+…, a+b+c+…).

f s t maps (a, b, c…) to a. This is our “head” function.

d dips only the head of its argument: (a, b, c…) → (|a−1|, b, c…)

r is the main repetition logic. We map (a, b) to (*r(|a−1|, b), b).

For example, r(4, 7) will evaluate as

  r(4, 7)
= r(3, 7), 7
= r(2, 7), 7, 7
= r(1, 7), 7, 7, 7
= r(0, 7), 7, 7, 7, 7
  → This would call r(1, 7), but (1, 7) ≥ (0, 7), so surrender!
= 0, 7, 7, 7, 7, 7.

Finally, we define 2, which maps n → (n, n), and define main as f f r 2, computing r(n, n) and chopping off the first two elements.

Answer 14

Japt, 2 bytes

ÆU

Test it

---

Explanation

Implicit input of integer U. Generate an array of integers from 0 to U-1. Fill it with U. Implicit output of resulting array.

Answer 15

Perl 5, 18 14 bytes

-4 bytes thanks to @DomHastings

sub{(@_)x"@_"}

Try it online!

Is x a builtin that does the entire task? Sort of? Not really? Rules unclear?

Edit: Yeah, probably it's fine.

Answer 16

Java (OpenJDK 8), 50 48 bytes

n->java.util.Arrays.stream(new int[n]).map(i->n)

Try it online!

-2 bytes thanks to @Jakob

Inspired by the comments in @OlivierGrégoire's post, and optimized a little further. Takes an integer input, creates an IntStream of n elements, then maps each element to n and returns it.

Answer 17

Haskell (14 bytes)

replicate>>=id

Thanks to @nimi, I don't need any import anymore. Yay!

It's a function that takes an integer argument; for example, the following returns [5,5,5,5,5]:

(replicate>>=id) 5

Answer 18

TeX, 81 bytes

\newcommand{\f}[1]{#1\count0=2\loop,#1\advance\count0 by1\ifnum\count0<#1\repeat}

Usage

\documentclass[12pt,a4paper]{article}
\begin{document}
\newcommand{\f}[1]{#1\count0=2\loop,#1\advance\count0 by1\ifnum\count0<#1\repeat}

\f{5}

\f{10}
\end{document}

Answer 19

Husk, 2 bytes

´R

Try it online!

´    -- Apply next function twice to same argument
 R   -- given an integer n and some element, replicate the element n-times

---

Polite alternative (3 bytes)

ṠIR

Try it online!

Answer 20

J, 2 bytes

$~

Same as the APL answer: reflexively shape the input. In other words:

$~ y
y $ y
NB. y copies of y

Answer 21

Brainbash, 39 bytes

>-[-[-<]>>+<]>->#[->+>+<<]>>[-<;<<.>>>]

Try it online!

Prints N N times. Works by generating 32, taking input, then duplicating the input twice, then output the first for each 1 in the second.

Answer 22

C (gcc), 55 bytes

int*f(k){int*r=malloc(k*4),a=k;for(;a-->0;)r[a]=k;k=r;}

Try it online!

Returns a list of k integers.

Answer 23

Röda, 10 bytes

{[[_]*_1]}

Try it online!

Explanation:

{[[_]*_1]}
{        } /* Anonymous function   */
   _       /* The input (_1)       */
  [ ]      /* As a list            */
     *_1   /* Repeated _1 times    */
 [      ]  /* Pushed to the stream */

Answer 24

Coreutils, sed, 14 bytes

yes $1|sed $1q

As a zsh function, 20 19 bytes:

f(){yes $1|sed $1q}

Try it online!

Answer 25

MATL, 4 3 bytes

tY"

Try it online!

Explanation:

t       % duplicate elements
Y"      % replicate elements of array
        % (implicit) convert to string and display

Answer 26

Groovy, 9 bytes

{[it]*it}

Try it online!

---

Perhaps the most competitive groovy answer I've done to date.

Answer 27

brainfuck, 16 bytes

[->+>+<<]>[->.<]

Try it online!

The breakdown:

[->+>+<<]          Duplicate 'n' into the next 2 cells to the right
         >         Move to the first duplicate
          [->.<]   Print 'n', 'n' times

As I'm sure you're aware, brainfuck takes input and output values as ASCII characters. So a ! is represented as the value 33.

Answer 28

Java (OpenJDK 8), 58 56 bytes

n->{int a[]=new int[n],i=n;for(;i-->0;)a[i]=n;return a;}

Try it online!

-2 bytes thanks to @KevinCruijssen

Answer 29

Swift 3, 29 bytes

{n in(0..<n).map{_ in n}}

Try it here!

Swift 3, 30 bytes

{Array(repeating:$0,count:$0)}

Try it here!

Answer 30

C# (Mono), 38 37 bytes

n=>System.Linq.Enumerable.Repeat(n,n)

Old version for 38 bytes:

n=>"".PadLeft(n,(char)n).ToCharArray()

Try it online!

A char in C# is an int underneath so this appears to be valid.

---

C# (Mono), 44 bytes

using System.Linq;n=>new int[n].Select(_=>n)

If the above is invalid this is for an extra 6 bytes.

Try it online!

Answer 31

Tampio, 109 85 bytes

a:n uni on a a:na
nolla a:na on tyhjyys
a:n seuraaja o:na on o lisättynä a:han o:na

Explanation:

a:n uni on   a a:na
uni(a)  =  f(a,a)

  nolla a:na on tyhjyys
f(0,    a)   =  []

  a:n seuraaja o:na on o lisättynä a:han o:na
f(a   +1,      o)   =  o :       f(a,    o)

uni(a)   = f(a,a)
f(0  ,a) = []
f(a+1,o) = o : f(a,o)

Answer 32

PHP, 19 Bytes

I'm new here can anyone tell if this is ok ?

for(;$b--;)$a[]=$n;

try it online!

EDIT:

looks to not be a valid form so :

32 Bytes (by Titus)

(+1 Byte for R flag)

for($b=$argn;$b--;)echo$argn,_;

try it online!

Answer 33

cQuents v0, 3 bytes

::n

Try it online!

Explanation

::    Mode: sequence 2. Given input n, output the sequence n times
  n   Each item in the sequence is n

Answer 34

Common Lisp, 31 bytes

(lambda(x)(fill(make-list x)x))

Try it online!

Answer 35

Perl 6, 9 bytes

{$_ xx$_}

Try it online

Uses the built-in list/statement repeat operator xx

Answer 36

Kotlin, 22 bytes

{n:Int->(1..n).map{n}}

Try it online!

Answer 37

Element, 9 bytes

_2:'[2:`]

Try it online!

_        input 
2:       double the input 
'        push one to control stack
[2:`]    for (number), double it, output one of them

Answer 38

Ruby, 10 characters

->n{[n]*n}

Sample run:

irb(main):001:0> ->n{[n]*n}[5]
=> [5, 5, 5, 5, 5]

Try it online!

Ruby, 18 characters

->n{Array.new n,n}

Sample run:

irb(main):001:0> ->n{Array.new n,n}[5]
=> [5, 5, 5, 5, 5]

Try it online!

Answer 39

PowerShell, 13 10 bytes

{@($_)*$_}

Usage

PS C:\> 2 | % {@($_)*$_}
2
2

And:

PS C:\> 5 | % {@($_)*$_}
5
5
5
5
5

By default, PowerShell shows array content one element per line. Running it through the ConvertTo-Json cmdlet shows it in a more familiar form:

PS C:\> 5 | % {@($_)*$_} | ConvertTo-Json -Compress
[5,5,5,5,5]

Answer 40

TI Basic, 10 bytes

This assumes an empty list

Ans→dim(L₁:L₁+Ans

Here's the hex, along with the code to explain the byte count:

72  04 B5   5D 00 3E 5D 00 70 71
Ans →  dim( L₁    :  L₁    +  Ans

How?

Ans→dim(L₁:L₁+Ans
Ans→dim(L₁        Since the list is empty, this makes L₁ a list on Ans 0's
          :       Separator
           L₁+Ans Since TI-Basic vectorizes some commands,
                  this adds Ans (basically the input here) to each element in L₁,
                  which results in Ans for each element.

Answer 41

TI Basic, 6 bytes

Ans+0rand(Ans

Thanks to @Oki for this solution!

Answer 42

Recursiva, 4 bytes

*aAa

Try it online!

Explanation:

*a  : Multiply a times(Here, 8) [8,8,8,8,8,8,8,8] 
  A : List-ify a [8]
   a: All a's will be assigned with the first input argument) 8 

Answer 43

Charcoal, 9 5 4 3 bytes

Ｅθθ

Try it online!

-4 bytes thanks to Neil, -1 byte thanks to Erik the Outgolfer

Explanation

Ｅ  Ｉθ Map with lambda returning first input cast to integer
  Ｎ    Implicit range over next (first) input

Answer 44

Ohm, 4 bytes

DÄWî

Try it online!

DÄWî

D     duplicate
 Ä    push n onto the stack n times
  W   wrap the stack in a list
   î  cast to integer

Answer 45

Pyke, 3 bytes

]1*

Try it here!

]1  - Wrap the input into a list.
  * - Repeat the list.

Answer 46

J, 2 bytes

#~

Try it online!

# copy

~ self

Answer 47

Pari/GP, 16 bytes

n->[n|x<-[1..n]]

Try it online!

Or:

n->vector(n,x,n)

Try it online!

Or:

n->powers(1,n,n)

Try it online!

Answer 48

Stacked, 6 bytes

[:rep]

Try it online!

This is an anonymous function that takes input on the stack and leaves output on the stack. This simply takes the input, duplicates it, then repeats the input by the input.

Answer 49

QBasic 4.5, 48 bytes

INPUT a
DIM t(a)
FOR x=1TO a
t(x)=a
NEXT

Answer 50

Aceto, 3 bytes

Assumes the integer is on the stack already.

d×

This just duplicates the top stack element and then performs stack multiplication (i.e. Python's [x]*y).

Answer 51

SOGL V0.12, 2 bytes

∙r

Try it Here!
Outputs to the stack.
Explanation:

∙   multiply POP (string, defaults to input) by POP (number, defaults to the same input)
     vertically - so to an array of strings
 r  swap types - convert the strings to numbers

Answer 52

Brain-Flak, 28, 22 bytes

{(({}[()])<>[]())<>}<>

Try it online!

Normally, the version that uses one stack would be shorter. However, in this case it's 6 bytes longer:

(({})){({}<(({}))>[()])}{}{}

Answer 53

Gaia, 2 bytes

w×

Try it online!

w   Wrap input into list
 ×  Repeat (input) times

Answer 54

MY, 6 bytes

ωi×ω+↵

Try it online!

How?

• ω, push the first command line argument evaluated
• i, pop n; push [1...n]
• ×, pop a; pop b; push b*a. 0 is popped when there is nothing on the stack. Since commands vectorize ("vecify" in MY), it ends up being an array of n 0's.
• ω, push the first command line argument evaluated
• +, pop a; pop b; push b+a. Adds the command line argument to every item in the array of 0 repeated n times, giving us n repeated n times
• ↵, pop n; print n with a newline.

Answer 55

Prolog (SWI), 33 bytes

X*L:-maplist(=(X),L),length(L,X).

Try it online!

Answer 56

Tcl, 22 bytes

time {lappend L $n} $n

Try it online!

---

With built-ins:

Tcl, 13 bytes

lrepeat $n $n

Try it online!

Answer 57

MacOS bash, 12

jot $1 $1 $1

This also works on Linux if the jot package is installed, e.g. sudo apt install athena-jot.

Try it online.

Answer 58

Actually, 2 bytes

;α

Explanation:

;α
;   duplicate the input
 α  push a list containing n copies of n

α is not a builtin for this challenge by the usual definition, because it does not solve this challenge by itself. α takes the top stack element (call it a) and repeats the next stack element (b) a times. It's roughly equivalent to iterable multiplication in Python ([5, 1]*2 == [5, 5, 1, 1]), but also works on non-iterables (52α yields [5, 5]).

Try it online!

Answer 59

4, 32 bytes

3.700001000260201801500101010294

Try it online!

If you have concerns regarding the input format, please read this first.

Transpiles roughly as

grid[1] = grid[0] = input()
while grid[1] != 0:
  print(grid[0])
  grid[1] -= 1

Answer 60

Braingolf, 6 bytes

!A.$_=

Haven't had Dennis pull this version to TIO yet, but A used to be useless, it basically acted the same as & in most cases. Now it pops the top of the stack and repeats the next operator that many times.

Explanation

!A.$_=  Implicit input from commandline args
!A      Read top of stack without popping, run next operator that many times
  .     Duplicate top of stack
   $_   Pop top of stack
     =  Print stack

We have to pop the top of the stack because otherwise we'll have 1 too many copies of n. If we remove the ! and let A pop the top of the stack, duplicate will have nothing to duplicate.

"Proof"

Answer 61

Clojure, 13 bytes

#(repeat % %)

Answer 62

Coq, 68 bytes

fun n=>(fix f k n:=match n with|0=>nil|S n=>(k::f k n)%list end) n n

Of course there's a library function, giving 46 bytes:

Require List. Definition f n:=List.repeat n n.

Answer 63

Just found this lang and wanted to give it a go.

LOLCODE, 164 bytes

HAI 1.2
I HAS A CHZBRGR
GIMMEH CHZBRGR
CHZBRGR IS NOW A NUMBR
IM IN YR CRIB UPPIN YR HMBRGR TIL BOTH SAEM CHZBRGR AN HMBRGR
VISIBLE CHZBRGR
IM OUTTA YR CRIB
KTHXBYE

Try it online!

Answer 64

Pyt, 3 bytes

Đ⑴*

Explanation:

                Implicit input
Đ               Duplicates input
 ⑴             Pushes an array, [1,1,...,1], with input 1's, onto the stack
   *            Multiply the array element-wise by the input
                Implicit output

Try it online!

Answer 65

FORTH 21 Bytes

: B 0 DO DUP . LOOP ;

OUTPUT:

10 B
10 B 10 10 10 10 10 10 10 10 10 10 

Answer 66

Gol><>, 5 bytes

:MR:B

Try it online!

Example full program & How it works

1AGIE;GDlR~
:MR:B

1AG          Register row 1 as function G
   IE;       Take number input; halt on EOF
      G      Call G
       D     Print the stack contents
        lR~  Empty the stack
             Repeat indefinitely

:M           Duplicate top and decrement
  R:         Duplicate n-1 times
    B        Return

Answer 67

[Swift 3], 55 49 bytes

func a(n:Int)->[Int] {return (0..<n).map{_ in n}}

Answer 68

C++, 86 56 45 bytes

Thanks to @ceilingcat for saving 30 41 bytes!

#import<list>
#define f(n)std::list<int>(n,n)

Try it online!

Answer 69

REXX, 24 bytes

arg n
say copies(n' ',n)

Uses the built-in function copies(), and naturally, this being REXX, the copies are integers just as much as they are strings.

Answer 70

WendyScript, 10 bytes

#:(x)[x]*x

(#:(x)[x]*x)(5) // => [5,5,5,5,5]

Try it online!

Answer 71

V, 5 bytes

Du@"Ä

Try it online!

Answer 72

Pyth, 5 bytes

Super simple

.[QQY

Explanation:

.[QQY     Pad Y with eval(input) copies of eval(input)

Try it online!

Answer 73

8th, 42 37 bytes

Code

>r a:new ( r@ a:push ) r@ times rdrop

SED (Stack Effect Diagram) is: n -- a

Usage

: f >r a:new ( r@ a:push ) r@ times rdrop ;

ok> 5 f .
[5,5,5,5,5]

We could save another 6 bytes if we accept the idea of leaving numbers on r-stack after processing.

Answer 74

R, 7 bytes

0*1:n+n

Try it online!

Answer 75

VBA, 75 Bytes

Defined Function that takes input n of expected type Integer and returns an array of length n filled with n to STDOUT

Function l(n)
Dim o
ReDim o(1To n)
For i=1To n
o(i)=n
Next
l=o
End Function

Answer 76

Excel VBA, 49 Bytes

Anonymous VBE immediate window function that takes input from range [A1] and outputs a array of range values, o, with bounds (1 To [A1], 1) to the VBE immediate window.

[A1].Resize([A1],1)=[A1]:o=Sheet1.UsedRange.Value

Answer 77

Julia 12

~x=fill(x,x)

Also it kinda generalizes to tuples making tensors.

julia> ~3
3-element Array{Int64,1}:
 3
 3
 3

julia> ~tuple(2,4)
2×4 Array{Tuple{Int64,Int64},2}:
 (2, 4)  (2, 4)  (2, 4)  (2, 4)
 (2, 4)  (2, 4)  (2, 4)  (2, 4)

julia> ~tuple(2,4,3)
2×4×3 Array{Tuple{Int64,Int64,Int64},3}:
[:, :, 1] =
 (2, 4, 3)  (2, 4, 3)  (2, 4, 3)  (2, 4, 3)
 (2, 4, 3)  (2, 4, 3)  (2, 4, 3)  (2, 4, 3)

[:, :, 2] =
 (2, 4, 3)  (2, 4, 3)  (2, 4, 3)  (2, 4, 3)
 (2, 4, 3)  (2, 4, 3)  (2, 4, 3)  (2, 4, 3)

[:, :, 3] =
 (2, 4, 3)  (2, 4, 3)  (2, 4, 3)  (2, 4, 3)
 (2, 4, 3)  (2, 4, 3)  (2, 4, 3)  (2, 4, 3)

Answer 78

TI-BASIC, 12 bytes

Ans→dim(L₁:Ans(L₁+1

Assumes an empty list.

Answer 79

Objective-C 107 Bytes

#define a NSMutableArray
-(a*)f:(int)n{a*m=[a arrayWithCapacity:n];for(int i=0;i<n;i++)m[i]=@(n);return m;}

A little macro abuse and a basic loop, everyone else took the good languages...

Usage

[self f:5];

returns an array of number objects of the given value

Answer 80

Microscript II, 14 bytes

$s{o`s`+s}sNv*

Answer 81

Ly, 13 10 bytes

ns[>l<1-]>

Try it online!

Prints space-separated numbers. If outputting without a separator is allowed, ns[lu1-]; works for 9 bytes.

Explanation:

ns[>l<1-]>

ns         # take input and save it
  [        # loop
   >l<     # load save and push it to another stack
      1-   # decrement
        ]  # end loop
         > # go to other stack
           # implicitly print

Answer 82

F#, 32 bytes

let m n=List.map(fun x->n)[1..n]

Creates a list 1 to n, then mapping a function to each element to replace it with n.

Answer 83

Axiom, 23 bytes

f(x)==[x for i in 1..x]

This 15 bytes would be better

f(x)⊳[x|i∈1..x]

f(x) return the list contains x element x but Axiom is a good approximation to that. Goes under 15 bytes it seems too much golfed

Answer 84

Ruby, 12 bytes

->(n){[n]*n}

13 bytes

Array.new n,n

Answer 85

QBIC, 17 bytes

dim g(:)[a|g(b)=a

This is a direct port of my QBasic answer (48 bytes), and QBIC does what it does best: compressing QBasic.

Explanation

dim g(:) Defines an array of x elements, where x is a cmd line param
[a|      FOR b = 1 TO a (the : above creates 'a' and assigns the cmd line param to it)
g(b)=a   Set each array element to 'a'

Answer 86

dc, 21

?dsn[lnpr1-d0!=F]dsFx

Try it online!

Ungolfed:

# Read a number from standard input (?), save it to register n (sn) and leave a copy on the stack (d)
?dsn

# Function F: print register n as many times as the top of the stack shows
[            # start of macro
  lnp        # print register n
  r          # swap the counter to the top
  1-         # decrement counter
  d          # duplicate counter for the comparison
  0 !=F      # if counter is not zero run F again
]dsFx        # end of macro, save it to F (sF) and execute (d x)

Run on the command line like this:

echo 5 | dc dcscript

Output:

5
5
5
5
5

This shorter script works for n>1 (15 bytes):

? [d d z 1- <F]dsFx f

This uses the depth of the stack to determine when to stop.

Answer 87

Excel VBA, 26 Bytes

Anonymous VBE immediate window function that takes input, n from range [A1] and returns an array object X with n stuffed into it n times.

x=Split([Rept(A1&" ",A1)])

Answer 88

SNOBOL4 (CSNOBOL4), 41 bytes

R	R =ARRAY(N,N)	:(RETURN)
	DEFINE('R(N)')

Try it online!

ARRAY initializes an array with the given indices, in this case, 1:N. It has an optional argument which it uses to initialize all the values in the array.

Answer 89

///, 23 bytes

/i///0./.1//1/i,//.//i.

Try it online!

Since there is no other way to take input in ///, it is hard coded. Also, since /// is a string-based language, input is in unary.

Example with input 5:

/i/00000//0./.1//1/i,//.//i.

How it works (with example input 5):

/i/00000//0./.1//1/i,//.//i.    Program with input.
/i/00000/                       Replace i with input. This is to make 1 uniform input.
         /0./.1/                Replace "0." with ".1". This turns all the 0s to 1s in the later i without bothering the next piece of code.
                /1/i,/          Replace 1s with input and a comma. This places the input into where the 1s were, essentially replacing each unary char of the input with the input, delimited with commas.
                      /.//      Remove the period.
                          i.    Input with period, main thing being modified by code.

Answer 90

Python 3, 63 54 Bytes

Saved 9 bytes thanks to Xcoder

a=[];i=input()
for _ in" "*int(i):a+=(i);
print(a)

Same code but will print every iteration of the list, saves 2 bytes

a=[];i=input()
for _ in" "*int(i):a+=(i);print(a)

Answer 91

Fortran (GFortran), 45 bytes

SUBROUTINE B(I)
INTEGER A(I)
A=I
PRINT*,A
END

Try it online!

This is a simple version, in which the subroutine is used to avoid the allocation stuff, since we have a unknown length array. The TIO link leads to a version with the full program, with 67 bytes in total.

Answer 92

K (oK), 4 bytes

Solution:

x#x:

Try it online!

Explanation:

5#5 means take from 5, 5 times. But doesn't appear we can do the same trick as APL/J to reduce this one down.

x#x: / the solution
  x: / save input as x
x#   / take from it x times

Answer 93

Stax, 3 bytes

]x*

Run and debug it

Internally it actually converts an integer to the array required but the implicit output changes it to codepoints. By default, output by codepoint is allowed though.

Explanation

]      Convert input to singleton
 x*    Repeat input times

Answer 94

12-basic, 17 14 bytes

?[X=INPUT()]*X

Try

Answer 95

Kotlin, 20 19 15 bytes

Shorter Kotlin answer using the List constructor.

{n->List(n){n}}

Try it online!

Ungolfed:

// lambda function
{ n ->
    List(n) { n }  // create a List of n Ints where each item is n
}

Because List is actually an interface, List() is actually a function that creates a List of the specified type (here figured out through inference) and a fixed size, using the given lambda to initialize the value of each item. { n } means the lambda will always return the value of n.

Answer 96

Japt -m, 1 byte

N

Try it online!

-m is a flag that runs the program on each item in the input. Because the input is a number, it gets turned into a range first. N is the input.

Answer 97

Gol><>, 7 bytes

I:R:~D;

This uses the convenient 'D' - Debug operator, which outputs the stack!

I       //Get integer input
 :R:    //Repeat input, double the number
    ~D; //Delete the last item in the stack(to get the right number) and output the entire stack with debug

Try it online!