blocks|key|6354432|text|Dyalog+APL，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6354433|⍴⍨⍴⊢|code-block|syntax|javascript|6354434|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.dyalog.com/|1|https://tio.run/nexus/apl-dyalog#@5@m8KhtgsKj3i2PeleAyK5FXFyP@qaCRdMUDJHYRkhsYyS2yf//AA^0|0|A|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://www.dyalog.com/" rel="noreferrer">APL (Dyalog APL)</a>, 4 bytes</h1>



<pre class="lang-apl prettyprint-override"><code>⍴⍨⍴⊢
</code></pre>

<p><a href="https://tio.run/nexus/apl-dyalog#@5@m8KhtgsKj3i2PeleAyK5FXFyP@qaCRdMUDJHYRkhsYyS2yf//AA" rel="noreferrer" title="APL (Dyalog APL) – TIO Nexus">Try it online!</a></p>


blocks|key|6354787|text|R，26|type|header-two|depth|inlineStyleRanges|entityRanges|data|6354788|这是显而易见的答案，但也许还有更聪明的答案吗？|unstyled|6354789|n=scan();array(n,rep(n,n))|code-block|syntax|javascript|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|M|8|@]|9|@]|A|$H|I]]]|J|$]]

<h1>R, 26</h1>
<p>This is the obvious answer but perhaps there is something cleverer?</p>
<pre><code>n=scan();array(n,rep(n,n))
</code></pre>


blocks|key|6354966|text|哈斯克尔，52字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6354967|f+n=iterate(filter(>'"').show.(<$[1..n]))(show+n)!!n|code-block|syntax|javascript|6354968|在网上试试！|unstyled|6354969|受@nimi的答复的启发，但使用更多的预定义函数。|6354970|使用iterate和!!而不是递归的帮助函数。|unordered-list-item|style|CODE|6354971|不用“手工”构造列表分隔符，而是使用filter(>'"').show格式化字符串列表，然后去掉多余的"字符。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/nexus/haskell#FchBCoAgEAXQq3xDcGYzEG2zi0QLKSWhJiih41vuHu8MWeGRtcQ7rAUWCYI7hq0mqM@tS6SUj180uc6xPPv1Co127kV0YaYWUDZGax0@|2|https://codegolf.stackexchange.com/a/111700^0|0|4|0|0|0|0|6|1|0|1|8|2|0|2|7|A|2|0|I|H|1F|1^^$0|@$1|2|3|4|5|6|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|D|3|E|5|F|7|19|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1A|8|@]|9|@$A|1B|B|1C|1|1D]]|C|$]]|$1|L|3|M|5|K|7|1E|8|@]|9|@$A|1F|B|1G|1|1H]]|C|$]]|$1|N|3|O|5|P|7|1I|8|@$A|1J|B|1K|Q|R]|$A|1L|B|1M|Q|R]]|9|@]|C|$]]|$1|S|3|T|5|P|7|1N|8|@$A|1O|B|1P|Q|R]|$A|1Q|B|1R|Q|R]]|9|@]|C|$]]]|U|$V|$5|W|X|Y|C|$Z|10]]|11|$5|W|X|Y|C|$Z|12]]|13|$5|W|X|Y|C|$Z|14]]]]

<h1><a href="https://www.haskell.org/" rel="nofollow noreferrer">Haskell</a>, 52 bytes</h1>



<pre class="lang-hs prettyprint-override"><code>f n=iterate(filter(&gt;'"').show.(&lt;$[1..n]))(show n)!!n
</code></pre>

<p><a href="https://tio.run/nexus/haskell#FchBCoAgEAXQq3xDcGYzEG2zi0QLKSWhJiih41vuHu8MWeGRtcQ7rAUWCYI7hq0mqM@tS6SUj180uc6xPPv1Co127kV0YaYWUDZGax0@" rel="nofollow noreferrer" title="Haskell – TIO Nexus">Try it online!</a></p>

<p>Inspired by <a href="https://codegolf.stackexchange.com/a/111700">@nimi's answer</a>, but using more predefined functions.</p>

<ul>
<li>Uses <code>iterate</code> and <code>!!</code> instead of a recursive help function.</li>
<li>Instead of constructing list delimiters "by hand", uses <code>filter(&gt;'"').show</code> to format a list of strings, then stripping away the extra <code>"</code> characters.</li>
</ul>


blocks|key|926378|text|Python+2，36字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|926379|-2字节感谢@CalculatorFeline|unstyled|926380|a=n=input()
exec"a=[a]*n;"*n
print+a|code-block|syntax|javascript|926381|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/nexus/python2#@59om2ebmVdQWqKhyZVakZqslGgbnRirlWetpJX3v6AoM69EI1HzvwkA^0|0|8|0|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|11|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://docs.python.org/2/" rel="noreferrer">Python 2</a>, 36 bytes</h1>

<p>
-2 bytes thanks to @CalculatorFeline</p>

<pre class="lang-python prettyprint-override"><code>a=n=input()
exec"a=[a]*n;"*n
print a
</code></pre>

<p><a href="https://tio.run/nexus/python2#@59om2ebmVdQWqKhyZVakZqslGgbnRirlWetpJX3v6AoM69EI1HzvwkA" rel="noreferrer" title="Python 2 – TIO Nexus">Try it online!</a></p>


blocks|key|6354755|text|果冻，5+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6354756|⁾Wẋẋv|code-block|syntax|javascript|6354757|在网上试试！|6354758|怎么做？|6354759|⁾Wẋẋv+-+Main+link:+n++++++++++++++++++++++++++++e.g.+++++++3
⁾Wẋ+++-+character+pair+literal+['W','ẋ']++++++++++++++++++"Wẋ"
+++ẋ++-+repeat+list+n+times+++++++++++++++++++++++++++++++"WẋWẋWẋ"
++++v+-+evaluate+as+Jelly+code+with+input+n++++++++++eval("WẋWẋWẋ",+3)
++++++-+...
++++++++WẋWẋ...+-+toEval:+n++++++++++++++++e.g.+3
++++++++W++++++++-+wrap++++++++++++++++++++++++[3]
+++++++++ẋ+++++++-+repeat+list+n+times+++++++++[3,3,3]
++++++++++Wẋ+++++-+wrap+and+repeat++++++++++++[[3,3,3],[3,3,3],[3,3,3]]
++++++++++++...++-+n+times+total+++++++++++++[[[3,3,3],[3,3,3],[3,3,3]],[[3,3,3],[3,3,3],[3,3,3]],[[3,3,3],[3,3,3],[3,3,3]]]|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://github.com/DennisMitchell/jelly/wiki/Code-page|2|https://tio.run/nexus/jelly#@/@ocV/4w13dQFT2//9/EwA^0|0|2|0|5|3|1|0|0|0|6|2|0|0^^$0|@$1|2|3|4|5|6|7|Z|8|@]|9|@$A|10|B|11|1|12]|$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|K|3|L|5|6|7|1B|8|@]|9|@]|C|$]]|$1|M|3|N|5|F|7|1C|8|@]|9|@]|C|$G|H]]]|O|$P|$5|Q|R|S|C|$T|U]]|V|$5|Q|R|S|C|$T|W]]|X|$5|Q|R|S|C|$T|Y]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="noreferrer">Jelly</a>, 5 <a href="https://github.com/DennisMitchell/jelly/wiki/Code-page" rel="noreferrer">bytes</a></h1>
<pre><code>⁾Wẋẋv
</code></pre>
<p><strong><a href="https://tio.run/nexus/jelly#@/@ocV/4w13dQFT2//9/EwA" rel="noreferrer" title="Jelly – TIO Nexus">Try it online!</a></strong></p>
<h3>How?</h3>
<pre><code>⁾Wẋẋv - Main link: n                            e.g.       3
⁾Wẋ   - character pair literal ['W','ẋ']                  &quot;Wẋ&quot;
   ẋ  - repeat list n times                               &quot;WẋWẋWẋ&quot;
    v - evaluate as Jelly code with input n          eval(&quot;WẋWẋWẋ&quot;, 3)
      - ...
        WẋWẋ... - toEval: n                e.g. 3
        W        - wrap                        [3]
         ẋ       - repeat list n times         [3,3,3]
          Wẋ     - wrap and repeat            [[3,3,3],[3,3,3],[3,3,3]]
            ...  - n times total             [[[3,3,3],[3,3,3],[3,3,3]],[[3,3,3],[3,3,3],[3,3,3]],[[3,3,3],[3,3,3],[3,3,3]]]
         
</code></pre>


blocks|key|6355582|text|果冻，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6355583|R»µ¡|code-block|syntax|javascript|6355584|在网上试试！|unstyled|6355585|R»µ¡
R+++++Range.+2+->+[1,+2]
+»++++Max+between+left+arg+and+right+arg.+Vectorizes.+->+[2,+2]
++µ+++Separates+into+a+new+chain.
+++¡++Repeat+2+times.+After+another+iteration+this+yields+[[2,+2],+[2,+2]].|6355586|同样的事情，但只有一个单一的，不需要链分离器：|6355587|4字节|6355588|»€`¡|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/##y0rNyan8/z/o0O5DWw8t/P//vzEA|2|https://tio.run/##y0rNyan8///Q7kdNaxIOLfz//78xAA^0|0|2|0|0|0|0|6|1|0|0|0|0|3|2|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|L|3|M|5|F|7|1D|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|1E|8|@]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1F|8|@]|9|@$A|1G|B|1H|1|1I]]|C|$]]|$1|R|3|S|5|F|7|1J|8|@]|9|@]|C|$G|H]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]|12|$5|V|W|X|C|$Y|13]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a>, 4 bytes</h1>

<pre><code>R»µ¡
</code></pre>

<p><a href="https://tio.run/##y0rNyan8/z/o0O5DWw8t/P//vzEA" rel="nofollow noreferrer" title="Jelly – Try It Online">Try it online!</a></p>

<pre><code>R»µ¡
R     Range. 2 -&gt; [1, 2]
 »    Max between left arg and right arg. Vectorizes. -&gt; [2, 2]
  µ   Separates into a new chain.
   ¡  Repeat 2 times. After another iteration this yields [[2, 2], [2, 2]].
</code></pre>

<p>Same thing but with a single monad and no need for the chain separator:</p>

<p><a href="https://tio.run/##y0rNyan8///Q7kdNaxIOLfz//78xAA" rel="nofollow noreferrer"><strong>4 bytes</strong></a></p>

<pre><code>»€`¡
</code></pre>


blocks|key|926484|text|CJam，12字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|926485|ri:X{aX*}X*p|code-block|syntax|javascript|926486|在网上试试！|unstyled|926487|解释|926488|ri:X++++++++++Read+an+integer+from+input,+store+it+in+X+(leaves+it+on+the+stack)
++++{+++}X*+++Execute+this+block+X+times:
+++++a++++++++++Wrap+the+top+of+stack+in+an+array
++++++X*++++++++Repeat+the+array+X+times
+++++++++++p++Print+nicely|entityMap|0|LINK|mutability|MUTABLE|url|https://sourceforge.net/p/cjam|1|https://tio.run/nexus/cjam#@1@UaRVRnRihVRuhVfD/vzEA^0|0|4|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://sourceforge.net/p/cjam" rel="noreferrer">CJam</a>, 12 bytes</h1>

<pre><code>ri:X{aX*}X*p
</code></pre>

<p><a href="https://tio.run/nexus/cjam#@1@UaRVRnRihVRuhVfD/vzEA" rel="noreferrer" title="CJam – TIO Nexus">Try it online!</a></p>

<p><strong>Explanation</strong></p>

<pre><code>ri:X          Read an integer from input, store it in X (leaves it on the stack)
    {   }X*   Execute this block X times:
     a          Wrap the top of stack in an array
      X*        Repeat the array X times
           p  Print nicely
</code></pre>


blocks|key|927168|text|JavaScript+(ES6)，38字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|927169|f=(n,m=n)=>m?Array(n).fill(f(n,m-1)):n|code-block|syntax|javascript|927170|需要内存的版本是45个字节：|unstyled|927171|f=(n,m=n)=>m?[...Array(n)].map(_=>f(n,m-1)):n|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|O|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|P|8|@]|9|@]|A|$E|F]]]|L|$]]

<h2>JavaScript (ES6), 38 bytes</h2>

<pre><code>f=(n,m=n)=&gt;m?Array(n).fill(f(n,m-1)):n
</code></pre>

<p>The memory-hungry version of this is 45 bytes:</p>

<pre><code>f=(n,m=n)=&gt;m?[...Array(n)].map(_=&gt;f(n,m-1)):n
</code></pre>


blocks|key|6355090|text|批处理，141个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6355091|@set+t=.
@for+/l+%25%25i+in+(2,1,%251)do+@call+set+t=%25%25t%25%25,.
@set+s=%251
@for+/l+%25%25i+in+(1,1,%251)do+@call+call+set+s=[%25%25%25%25t:.=%25%25s%25%25%25%25%25%25]
@echo+%25s%25|code-block|syntax|javascript|6355092|批处理实际上没有数组，因此它只打印数组的字符串表示形式。说明:前两行建立了N+.s的重复模式，由N-1+,s在变量t中分离。然后，第四行使用它作为替换模式N倍来创建N-dimensional数组。双call是必要的，因为for和set语句是如何工作的。首先，for命令替换变量。碰巧，我所有的%25符号都加倍了，所以这只会取消引用它们，从而导致call+call+set+s=[%25%25t:.=%25s%25%25%25]。然后，它重复生成的语句N时间。每次，call命令都会替换变量。此时，s变量只有一组%25s，因此被替换，从而产生(例如)+call+set+s=[%25t:.=[2,2]%25]。然后内部调用替换t变量，从而产生(例如)+set+s=[[2,2],[2,2]]，执行所需的赋值。然后打印s的最终值。|unstyled|offset|length|style|CODE|entityMap^0|0|0|11|1|13|1|1C|3|1G|1|1L|1|25|1|2A|1|2R|4|32|3|36|3|3L|3|42|1|4Q|T|5V|1|62|4|6I|1|6P|1|77|O|84|1|8H|J|9D|1^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@$J|R|K|S|L|M]|$J|T|K|U|L|M]|$J|V|K|W|L|M]|$J|X|K|Y|L|M]|$J|Z|K|10|L|M]|$J|11|K|12|L|M]|$J|13|K|14|L|M]|$J|15|K|16|L|M]|$J|17|K|18|L|M]|$J|19|K|1A|L|M]|$J|1B|K|1C|L|M]|$J|1D|K|1E|L|M]|$J|1F|K|1G|L|M]|$J|1H|K|1I|L|M]|$J|1J|K|1K|L|M]|$J|1L|K|1M|L|M]|$J|1N|K|1O|L|M]|$J|1P|K|1Q|L|M]|$J|1R|K|1S|L|M]|$J|1T|K|1U|L|M]|$J|1V|K|1W|L|M]]|9|@]|A|$]]]|N|$]]

<h2>Batch, 141 bytes</h2>

<pre><code>@set t=.
@for /l %%i in (2,1,%1)do @call set t=%%t%%,.
@set s=%1
@for /l %%i in (1,1,%1)do @call call set s=[%%%%t:.=%%s%%%%%%]
@echo %s%
</code></pre>

<p>Batch doesn't actually have arrays so this just prints the string representation of an array. Explanation: The first two lines build up a repeated pattern of <code>N</code> <code>.</code>s separated by <code>N-1</code> <code>,</code>s in the variable <code>t</code>. The fourth line then uses this as a substitution pattern <code>N</code> times to create the <code>N</code>-dimensional array. The double <code>call</code> is necessary because of how the <code>for</code> and <code>set</code> statements work. First, the <code>for</code> command substitutes variables. As it happens, all of my <code>%</code> signs are doubled, so this does nothing except to unquote them all, resulting in <code>call call set s=[%%t:.=%s%%%]</code>. It then repeats the resulting statement <code>N</code> times. Each time, the <code>call</code> command substitutes variables. At this point, the <code>s</code> variable only has a single set of <code>%</code>s, so it gets substituted, resulting in (e.g.) <code>call set s=[%t:.=[2,2]%]</code>. The inner call then substitutes the <code>t</code> variable, resulting in (e.g.) <code>set s=[[2,2],[2,2]]</code>, performing the desired assignment. The final value of <code>s</code> is then printed.</p>


blocks|key|6354196|text|果冻，5字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6354197|Wẋ³µ¡|code-block|syntax|javascript|6354198|在网上试试！|unstyled|6354199|解释|6354200|+++++++++Implicit+input:+N
+++µ¡++++Apply+N+times+to+input:
Wẋ³++++++++“N+copies+of”|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/nexus/jelly#@x/@cFf3oc2Hth5a@P//fxMA^0|0|2|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a>, 5 bytes</h1>

<pre><code>Wẋ³µ¡
</code></pre>

<p><a href="https://tio.run/nexus/jelly#@x/@cFf3oc2Hth5a@P//fxMA" rel="nofollow noreferrer" title="Jelly – TIO Nexus">Try it online!</a></p>

<h2>Explanation</h2>

<pre><code>         Implicit input: N
   µ¡    Apply N times to input:
Wẋ³        “N copies of”
</code></pre>


blocks|key|927244|text|Ruby，27字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|927245|->a{(z=a).times{z=[z]*a};z}|code-block|syntax|javascript|927246|只增加了一个字节，但使用了另一种方法，而不是xnor出色的Python答案中的“eval”技巧。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h2>Ruby, 27 bytes</h2>
<pre><code>-&gt;a{(z=a).times{z=[z]*a};z}
</code></pre>
<p>Only 1 byte more but using a different approach instead of the 'eval' trick from xnor's wonderful Python answer.</p>


blocks|key|927967|text|哈斯克尔，51字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|927968|除了现有的Haskell解决方案之外，这还构造了一个可用的数据类型，而不仅仅是它的字符串表示(并且更短)：|unstyled|927969|data+L=N[L]%7CE+Int
f+n=iterate(N.(<$[1..n]))(E+n)!!n|code-block|syntax|javascript|927970|在网上试试！|927971|解释/+Ungolfed|927972|在Haskell中，这是一个有趣的挑战，原因是解决此挑战的解决方案需要返回不同的嵌套列表，而Haskell+(不导入外部模块)不支持这一点。有一种方法被证明是最棒的，那就是定义我们自己的数据类型：|927973|data+NestedList+=+Nest+[NestedList]+%7C+Entry+Int|927974|现在我们只需定义一个函数f+::+Int+->+NestedList，它能够表示所有所需的数据类型：|style|CODE|927975|pow+n+=+iterate+(Nest+.+replicate+n)+(Entry+n)+!!+n|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/##PYyxCoNAEET7@4oRUniFQiClVsEiIDZJJxZHXHNHzBruNmgg/24UQZiBea8Ya8KT@n6eWyMGZV7VZfMrcGFRHTh3Qt4IxVUaZ4f6mKbcaB0XYB1FPCcJbtYFLBm4/4KJWmrhOoyE0bBABry9W4cleAqfXpTjIIbvhKsdRpQYLXlSQFhx@Z40kG807brCFPSug1Iv43jh7T1Ft9STaZFnGR4k54GFWMJ8@gM^0|0|4|0|0|0|0|0|6|1|0|0|0|0|C|M|0^^$0|@$1|2|3|4|5|6|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]|$1|D|3|E|5|F|7|1C|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|1D|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|1E|8|@]|9|@$A|1F|B|1G|1|1H]]|C|$]]|$1|N|3|O|5|6|7|1I|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1J|8|@]|9|@]|C|$]]|$1|R|3|S|5|I|7|1K|8|@]|9|@]|C|$J|K]]|$1|T|3|U|5|F|7|1L|8|@$A|1M|B|1N|V|W]]|9|@]|C|$]]|$1|X|3|Y|5|I|7|1O|8|@]|9|@]|C|$J|K]]]|Z|$10|$5|11|12|13|C|$14|15]]|16|$5|11|12|13|C|$14|17]]]]

<h1><a href="https://www.haskell.org/" rel="noreferrer">Haskell</a>, 51 bytes</h1>



<p>Other than the existing Haskell solutions this constructs a usable data type not just a string representation thereof (and is shorter):</p>

<pre class="lang-hs prettyprint-override"><code>data L=N[L]|E Int
f n=iterate(N.(&lt;$[1..n]))(E n)!!n
</code></pre>

<p><a href="https://tio.run/##PYyxCoNAEET7@4oRUniFQiClVsEiIDZJJxZHXHNHzBruNmgg/24UQZiBea8Ya8KT@n6eWyMGZV7VZfMrcGFRHTh3Qt4IxVUaZ4f6mKbcaB0XYB1FPCcJbtYFLBm4/4KJWmrhOoyE0bBABry9W4cleAqfXpTjIIbvhKsdRpQYLXlSQFhx@Z40kG807brCFPSug1Iv43jh7T1Ft9STaZFnGR4k54GFWMJ8@gM" rel="noreferrer" title="Haskell – Try It Online">Try it online!</a></p>

<h3>Explanation / Ungolfed</h3>

<p>The reason why this is an interesting challenge in Haskell is that a solution to this challenge needs to return different deeply nested lists and Haskell (without importing external modules) does not support this. One workaround which turned out to be the golfiest, is to define our own data type:</p>

<pre class="lang-hs prettyprint-override"><code>data NestedList = Nest [NestedList] | Entry Int
</code></pre>

<p>Now we can just define a function <code>f :: Int -&gt; NestedList</code> which is able to represent all the required data types:</p>

<pre class="lang-hs prettyprint-override"><code>pow n = iterate (Nest . replicate n) (Entry n) !! n
</code></pre>


blocks|key|6356150|text|拉库，21字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6356151|在网上试试！|unstyled|6356152|{[[xx]+[xx]+$_+xx+3]}|code-block|syntax|javascript|entityMap|0|LINK|mutability|MUTABLE|url|https://raku.org/|1|https://tio.run/##K0gtyjH7/786OrqiIlYBTKjEK1RUKBjH1mqkp5Zo6hUnVv7/bwQA^0|0|2|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|G|3|H|5|I|7|12|8|@]|9|@]|C|$J|K]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://raku.org" rel="noreferrer">Raku</a>, 21 bytes</h1>
<p><a href="https://tio.run/##K0gtyjH7/786OrqiIlYBTKjEK1RUKBjH1mqkp5Zo6hUnVv7/bwQA" rel="noreferrer">try it online!</a></p>
<pre><code>{[[xx] [xx] $_ xx 3]}
</code></pre>


blocks|key|6355053|text|Clojure，36字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6355054|#(nth(iterate(fn[a](repeat+%25+a))%25)%25)|code-block|syntax|javascript|6355055|迭代函数，重复其自变量n次数，产生无限序列的元，然后取其n第四元。|unstyled|offset|length|style|CODE|6355056|在网上看|entityMap|0|LINK|mutability|MUTABLE|url|https://ideone.com/l9pMOD^0|0|0|B|1|S|1|0|0|4|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@$J|Z|K|10|L|M]|$J|11|K|12|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|13|8|@]|9|@$J|14|K|15|1|16]]|A|$]]]|P|$Q|$5|R|S|T|A|$U|V]]]]

<h1>Clojure, 36 bytes</h1>

<pre><code>#(nth(iterate(fn[a](repeat % a))%)%)
</code></pre>

<p>Iterates function which repeats its argument <code>n</code> times, it produces infinite sequence of such elements and then takes its <code>n</code>th element. </p>

<p><a href="https://ideone.com/l9pMOD" rel="nofollow noreferrer">See it online</a> </p>


blocks|key|927139|text|Rebol，45字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|927140|func[n][array/initial+append/dup+copy[]n+n+n]|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>Rebol, 45 bytes</h1>

<pre><code>func[n][array/initial append/dup copy[]n n n]
</code></pre>


blocks|key|927220|text|Clojure，49字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|927221|(defmacro+r[n]`(->>+~n+~@(repeat+n`(repeat+~n))))|code-block|syntax|javascript|927222|不是最短的Clojure例子，但我对引用和取消引用感到好笑。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>Clojure, 49 bytes</h1>

<pre><code>(defmacro r[n]`(-&gt;&gt; ~n ~@(repeat n`(repeat ~n))))
</code></pre>

<p>Not the shortest Clojure example, but I amused myself with the quoting and unquoting.</p>


blocks|key|927088|text|Clojure，63字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|927089|#(loop[a(repeat+%25+%25)d+1](if(=+d+%25)a(recur(repeat+%25+a)(inc+d))))|code-block|syntax|javascript|927090|这是一个lambda函数，用法如下：|unstyled|927091|(#(...)+{input_no})|927092|将...where+{input_no}替换为数字。|offset|length|style|CODE|927093|3的输出如下：|927094|(((3+3+3)+(3+3+3)+(3+3+3))+((3+3+3)+(3+3+3)+(3+3+3))+((3+3+3)+(3+3+3)+(3+3+3)))|927095|这使用Clojure对列表的定义，它被表示为()。|927096|Ungolfed代码和说明：|927097|;+Defines+the+function
(defn+layered+[n]
++;+Begins+a+loop+with+a+variable+depth+of+1,
++;+and+a+list+of+n+elements+which+are+all+n
++(loop+[depth+1
+++++++++array+(repeat+n+n)]
++++;+If+"depth"+is+equal+to+n,+return+the+list
++++(if+(=+depth+n)+array
++++++;+Else,+continue+on+with+the+loop,+with
++++++;+an+incremented+"depth"...
++++++(recur+(inc+depth)
++++++++;+...and+a+list+which+contains+the
++++++++;+list+repeated+n+times
++++++++(repeat+n+array)))))|entityMap^0|0|0|0|0|A|A|0|0|1|0|0|M|2|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|13|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|14|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|15|8|@]|9|@]|A|$E|F]]|$1|L|3|M|5|I|7|16|8|@$N|17|O|18|P|Q]]|9|@]|A|$]]|$1|R|3|S|5|I|7|19|8|@$N|1A|O|1B|P|Q]]|9|@]|A|$]]|$1|T|3|U|5|D|7|1C|8|@]|9|@]|A|$E|F]]|$1|V|3|W|5|I|7|1D|8|@$N|1E|O|1F|P|Q]]|9|@]|A|$]]|$1|X|3|Y|5|6|7|1G|8|@]|9|@]|A|$]]|$1|Z|3|10|5|D|7|1H|8|@]|9|@]|A|$E|F]]]|11|$]]

<h1>Clojure, 63 bytes</h1>

<pre class="lang-clojure prettyprint-override"><code>#(loop[a(repeat % %)d 1](if(= d %)a(recur(repeat % a)(inc d))))
</code></pre>

<p>This is a lambda function, usage is like so:</p>

<pre><code>(#(...) {input_no})
</code></pre>

<p>...where <code>{input_no}</code> is replaced with the number.</p>

<p>Output for <code>3</code> is like this:</p>

<pre><code>(((3 3 3) (3 3 3) (3 3 3)) ((3 3 3) (3 3 3) (3 3 3)) ((3 3 3) (3 3 3) (3 3 3)))
</code></pre>

<p>This uses Clojure's definition of lists, which are denoted as <code>()</code>.</p>

<h2>Ungolfed code and explanation:</h2>

<pre class="lang-clojure prettyprint-override"><code>; Defines the function
(defn layered [n]
  ; Begins a loop with a variable depth of 1,
  ; and a list of n elements which are all n
  (loop [depth 1
         array (repeat n n)]
    ; If "depth" is equal to n, return the list
    (if (= depth n) array
      ; Else, continue on with the loop, with
      ; an incremented "depth"...
      (recur (inc depth)
        ; ...and a list which contains the
        ; list repeated n times
        (repeat n array)))))
</code></pre>


blocks|key|927666|text|SNOBOL4+(CSNOBOL4)，59字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|927667|	DEFINE('F(N)')
F	F+=ARRAY(DUPL(N+',',N+-+1)+N,N)	:(RETURN)|code-block|syntax|javascript|927668|在网上试试！|unstyled|927669|定义一个函数，该函数返回具有适当维度的ARRAY，并填充值N。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|http://www.snobol4.org/csnobol4/|1|https://tio.run/##K87LT8rPMfnPaaXhovmf08XVzdPPVUPdTcNPU12Ty43TTcHWMSjIMVLDJTTAR8NPQV1HXcdPQVfBUFPBT8dPE6gtyDUkNMhP878LumZO/9CQgNAQBVs3DVNNG2MdKLTjcvVz@Q8A^0|0|I|0|0|0|0|6|1|0|J|5|T|1^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@$A|18|B|19|N|O]|$A|1A|B|1B|N|O]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="http://www.snobol4.org/csnobol4/" rel="nofollow noreferrer">SNOBOL4 (CSNOBOL4)</a>, 59 bytes</h1>

<pre><code>&#9;DEFINE('F(N)')
F&#9;F =ARRAY(DUPL(N ',',N - 1) N,N)&#9;:(RETURN)
</code></pre>

<p><a href="https://tio.run/##K87LT8rPMfnPaaXhovmf08XVzdPPVUPdTcNPU12Ty43TTcHWMSjIMVLDJTTAR8NPQV1HXcdPQVfBUFPBT8dPE6gtyDUkNMhP878LumZO/9CQgNAQBVs3DVNNG2MdKLTjcvVz@Q8A" rel="nofollow noreferrer" title="SNOBOL4 (CSNOBOL4) – Try It Online">Try it online!</a></p>

<p>Defines a function that returns an <code>ARRAY</code> with the appropriate dimensions and filled with value <code>N</code>.</p>


blocks|key|928145|text|杰夫特，14字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|928146|_òU}g[UpU+ÆUÃ]|code-block|syntax|javascript|928147|在网上试试！|unstyled|928148|输出被包装在一个额外的单例数组中。|928149|解释：|928150|++++++++++Æ+Ã+++++#Create+an+array
+++++++++++U++++++#Where+every+element+is+U
++++++UpU+++++++++#And+the+length+is+U%5EU
_++}g[+++++++]++++#Repeat+this+function+U+times:
+òU+++++++++++++++#+Cut+into+slices+of+length+U|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|https://ethproductions.github.io/japt/?v=1.4.6&code=X/JVfWdbVXBVIMZVw10=&input=NAotUQ==^0|0|3|0|0|0|0|6|1|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1A|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1B|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 14 bytes</h1>

<pre><code>_òU}g[UpU ÆUÃ]
</code></pre>

<p><a href="https://ethproductions.github.io/japt/?v=1.4.6&amp;code=X/JVfWdbVXBVIMZVw10=&amp;input=NAotUQ==" rel="nofollow noreferrer">Try it online!</a></p>

<p>Output is wrapped in an extra singleton array.</p>

<p>Explanation:</p>

<pre><code>          Æ Ã     #Create an array
           U      #Where every element is U
      UpU         #And the length is U^U
_  }g[       ]    #Repeat this function U times:
 òU               # Cut into slices of length U
</code></pre>


blocks|key|6356495|text|K+(ngn/k)，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6356496|{(x#x)#x}|code-block|syntax|javascript|6356497|在网上试试！|unstyled|6356498|也许有一种方法可以让这件事变得默契。|entityMap|0|LINK|mutability|MUTABLE|url|https://codeberg.org/ngn/k|1|https://ngn.codeberg.page/k#eJxLs6rWqFCu0FSuqOXi4kpTMARiIyA2BmITAHCYBrY=^0|0|9|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://codeberg.org/ngn/k" rel="nofollow noreferrer">K (ngn/k)</a>, 9 bytes</h1>
<pre><code>{(x#x)#x}
</code></pre>
<p><a href="https://ngn.codeberg.page/k#eJxLs6rWqFCu0FSuqOXi4kpTMARiIyA2BmITAHCYBrY=" rel="nofollow noreferrer">Try it online!</a></p>
<p>There's probably a way to make this tacit.</p>


blocks|key|6355110|text|Python3，89+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|6355111|def+f(x):
+r=[x+for+_+in+range(x)]
+for+_+in+range(x-1):r=[r+for+_+in+range(x)]
+print(r)|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>Python 3, 89 Bytes</h1>
<pre><code>def f(x):
 r=[x for _ in range(x)]
 for _ in range(x-1):r=[r for _ in range(x)]
 print(r)
</code></pre>


blocks|key|6355464|text|利普，82字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6355465|(def+f+#N::((def+i+#N,I,K::((if(>+I+0)((i+N(-+I+1)(list-fill+N+K)))K)))(i+N+N+N)))|code-block|syntax|javascript|6355466|在网上试试！|unstyled|6355467|我试着把它作为一个列表理解来实现，但无法理解如何正确地完成它。相反，我选择了一个基于JavaScript答案的实现。不幸的是，我的语言相当长，这是复杂的事实，我缺乏速记和其他有用的功能。|6355468|在在网上试试链接上有一个更易读的版本。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/andrakis/node-lithp|1|https://andrakis.github.io/ide2/index.html?code=JSBBIHZhbGlkIGVudHJ5IGZvciBDb2RlR29sZjoKJSBodHRwOi8vY29kZWdvbGYuc3RhY2tleGNoYW5nZS5jb20vcXVlc3Rpb25zLzExMTY3OC9uLWRpbWVuc2lvbmFsLW5uLWFycmF5LWZpbGxlZC13aXRoLW4KKAogICAgJSBEZWZpbmUgb3VyIGZ1bmN0aW9uCiAgICAoZGVmIGYgI046OigKICAgICAgICAlIERlZmluZSBvdXIgaW5uZXIgZnVuY3Rpb24KICAgICAgICAoZGVmIGkgI04sSSxLIDo6ICgKICAgICAgICAgICAgKGlmICg%2BIEkgMCkgKAogICAgICAgICAgICAgICAgJSBDYWxsIHNlbGYgKGhlYWQgcmVjdXJzaW9uKSB3aXRoIHVwZGF0ZWQgcGFyYW1ldGVycwogICAgICAgICAgICAgICAgKGkgTiAoLSBJIDEpIChsaXN0LWZpbGwgTiBLKSkKICAgICAgICAgICAgKQogICAgICAgICAgICAlIGVsc2UgcmV0dXJuIEsKICAgICAgICAgICAgKEspKQogICAgICAgICkpCiAgICAgICAgJSBJbnZva2UgaW5uZXIgZnVuY3Rpb24KICAgICAgICAoaSBOIE4gTikKICAgICkpCiAgICAlIEdvbGZlZDoKICAgIChkZWYgZiAjTjo6KChkZWYgaSAjTixJLEs6OigoaWYoPiBJIDApKChpIE4oLSBJIDEpKGxpc3QtZmlsbCBOIEspKSlLKSkpKGkgTiBOIE4pKSkKICAgIAogICAgJSBUZXN0aW5nIHRoZSBmdW5jdGlvbgogICAgKHByaW50IChmIDEpKQogICAgKHByaW50IChmIDIpKQogICAgKHByaW50IChmIDMpKQogICAgJSBOb3RlIHRoYXQgYmV5b25kIGxldmVsIDMsIHlvdSBuZWVkIHRvIHVzZSBgaW5zcGVjdCAuLi4gdHJ1ZWAgdG8gZ2V0CiAgICAlIGZ1bGwgb3V0cHV0LgogICAgKHByaW50IChpbnNwZWN0IChmIDQpIHRydWUpKQogICAgKHByaW50IChpbnNwZWN0IChmIDUpIHRydWUpKQogICAgKHByaW50IChpbnNwZWN0IChmIDYpIHRydWUpKQop|2|https://andrakis.github.io/ide2/index.html?code=JSBBIHZhbGlkIGVudHJ5IGZvciBDb2RlR29sZjoKJSBodHRwOi8vY29kZWdvbGYuc3RhY2tleGNoYW5nZS5jb20vcXVlc3Rpb25zLzExMTY3OC9uLWRpbWVuc2lvbmFsLW5uLWFycmF5LWZpbGxlZC13aXRoLW4KKAogICAgJSBEZWZpbmUgb3VyIGZ1bmN0aW9uCiAgICAoZGVmIGYgI046OigKICAgICAgICAlIERlZmluZSBvdXIgaW5uZXIgZnVuY3Rpb24KICAgICAgICAoZGVmIGkgI04sSSxLIDo6ICgKICAgICAgICAgICAgKGlmICg%2BIEkgMCkgKAogICAgICAgICAgICAgICAgJSBDYWxsIHNlbGYgKGhlYWQgcmVjdXJzaW9uKSB3aXRoIHVwZGF0ZWQgcGFyYW1ldGVycwogICAgICAgICAgICAgICAgKGkgTiAoLSBJIDEpIChsaXN0LWZpbGwgTiBLKSkKICAgICAgICAgICAgKQogICAgICAgICAgICAlIGVsc2UgcmV0dXJuIEsKICAgICAgICAgICAgKEspKQogICAgICAgICkpCiAgICAgICAgJSBJbnZva2UgaW5uZXIgZnVuY3Rpb24KICAgICAgICAoaSBOIE4gTikKICAgICkpCiAgICAlIEdvbGZlZDoKICAgIChkZWYgZiAjTjo6KChkZWYgaSAjTixJLEs6OigoaWYoPiBJIDApKChpIE4oLSBJIDEpKGxpc3QtZmlsbCBOIEspKSlLKSkpKGkgTiBOIE4pKSkKICAgIAogICAgJSBUZXN0aW5nIHRoZSBmdW5jdGlvbgogICAgKHByaW50IChmIDEpKQogICAgKHByaW50IChmIDIpKQogICAgKHByaW50IChmIDMpKQogICAgJSBOb3RlIHRoYXQgYmV5b25kIGxldmVsIDMsIHlvdSBuZWVkIHRvIHVzZSBgaW5zcGVjdCAuLi4gdHJ1ZWAgdG8gZ2V0CiAgICAlIGZ1bGwgb3V0cHV0LgogICAgKHByaW50IChpbnNwZWN0IChmIDQpIHRydWUpKQogICAgKHByaW50IChpbnNwZWN0IChmIDUpIHRydWUpKQogICAgKHByaW50IChpbnNwZWN0IChmIDYpIHRydWUpKQop^0|0|2|0|0|0|0|6|1|0|0|1|5|2^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1A|8|@]|9|@$A|1B|B|1C|1|1D]]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]|Y|$5|R|S|T|C|$U|Z]]]]

<h2><a href="https://github.com/andrakis/node-lithp" rel="nofollow noreferrer">Lithp</a>, 82 bytes</h2>
<pre><code>(def f #N::((def i #N,I,K::((if(&gt; I 0)((i N(- I 1)(list-fill N K)))K)))(i N N N)))
</code></pre>
<p><a href="https://andrakis.github.io/ide2/index.html?code=JSBBIHZhbGlkIGVudHJ5IGZvciBDb2RlR29sZjoKJSBodHRwOi8vY29kZWdvbGYuc3RhY2tleGNoYW5nZS5jb20vcXVlc3Rpb25zLzExMTY3OC9uLWRpbWVuc2lvbmFsLW5uLWFycmF5LWZpbGxlZC13aXRoLW4KKAogICAgJSBEZWZpbmUgb3VyIGZ1bmN0aW9uCiAgICAoZGVmIGYgI046OigKICAgICAgICAlIERlZmluZSBvdXIgaW5uZXIgZnVuY3Rpb24KICAgICAgICAoZGVmIGkgI04sSSxLIDo6ICgKICAgICAgICAgICAgKGlmICg+IEkgMCkgKAogICAgICAgICAgICAgICAgJSBDYWxsIHNlbGYgKGhlYWQgcmVjdXJzaW9uKSB3aXRoIHVwZGF0ZWQgcGFyYW1ldGVycwogICAgICAgICAgICAgICAgKGkgTiAoLSBJIDEpIChsaXN0LWZpbGwgTiBLKSkKICAgICAgICAgICAgKQogICAgICAgICAgICAlIGVsc2UgcmV0dXJuIEsKICAgICAgICAgICAgKEspKQogICAgICAgICkpCiAgICAgICAgJSBJbnZva2UgaW5uZXIgZnVuY3Rpb24KICAgICAgICAoaSBOIE4gTikKICAgICkpCiAgICAlIEdvbGZlZDoKICAgIChkZWYgZiAjTjo6KChkZWYgaSAjTixJLEs6OigoaWYoPiBJIDApKChpIE4oLSBJIDEpKGxpc3QtZmlsbCBOIEspKSlLKSkpKGkgTiBOIE4pKSkKICAgIAogICAgJSBUZXN0aW5nIHRoZSBmdW5jdGlvbgogICAgKHByaW50IChmIDEpKQogICAgKHByaW50IChmIDIpKQogICAgKHByaW50IChmIDMpKQogICAgJSBOb3RlIHRoYXQgYmV5b25kIGxldmVsIDMsIHlvdSBuZWVkIHRvIHVzZSBgaW5zcGVjdCAuLi4gdHJ1ZWAgdG8gZ2V0CiAgICAlIGZ1bGwgb3V0cHV0LgogICAgKHByaW50IChpbnNwZWN0IChmIDQpIHRydWUpKQogICAgKHByaW50IChpbnNwZWN0IChmIDUpIHRydWUpKQogICAgKHByaW50IChpbnNwZWN0IChmIDYpIHRydWUpKQop" rel="nofollow noreferrer">Try it online!</a></p>
<p>I tried implementing this as a list comprehension, but couldn't comprehend how to do it correctly. Instead I went for an implementation based on the JavaScript answer. Unfortunately, my language is fairly long-winded, and this is complicated by the fact that I lack shorthand and other useful features.</p>
<p>A more readable version is available at the <a href="https://andrakis.github.io/ide2/index.html?code=JSBBIHZhbGlkIGVudHJ5IGZvciBDb2RlR29sZjoKJSBodHRwOi8vY29kZWdvbGYuc3RhY2tleGNoYW5nZS5jb20vcXVlc3Rpb25zLzExMTY3OC9uLWRpbWVuc2lvbmFsLW5uLWFycmF5LWZpbGxlZC13aXRoLW4KKAogICAgJSBEZWZpbmUgb3VyIGZ1bmN0aW9uCiAgICAoZGVmIGYgI046OigKICAgICAgICAlIERlZmluZSBvdXIgaW5uZXIgZnVuY3Rpb24KICAgICAgICAoZGVmIGkgI04sSSxLIDo6ICgKICAgICAgICAgICAgKGlmICg+IEkgMCkgKAogICAgICAgICAgICAgICAgJSBDYWxsIHNlbGYgKGhlYWQgcmVjdXJzaW9uKSB3aXRoIHVwZGF0ZWQgcGFyYW1ldGVycwogICAgICAgICAgICAgICAgKGkgTiAoLSBJIDEpIChsaXN0LWZpbGwgTiBLKSkKICAgICAgICAgICAgKQogICAgICAgICAgICAlIGVsc2UgcmV0dXJuIEsKICAgICAgICAgICAgKEspKQogICAgICAgICkpCiAgICAgICAgJSBJbnZva2UgaW5uZXIgZnVuY3Rpb24KICAgICAgICAoaSBOIE4gTikKICAgICkpCiAgICAlIEdvbGZlZDoKICAgIChkZWYgZiAjTjo6KChkZWYgaSAjTixJLEs6OigoaWYoPiBJIDApKChpIE4oLSBJIDEpKGxpc3QtZmlsbCBOIEspKSlLKSkpKGkgTiBOIE4pKSkKICAgIAogICAgJSBUZXN0aW5nIHRoZSBmdW5jdGlvbgogICAgKHByaW50IChmIDEpKQogICAgKHByaW50IChmIDIpKQogICAgKHByaW50IChmIDMpKQogICAgJSBOb3RlIHRoYXQgYmV5b25kIGxldmVsIDMsIHlvdSBuZWVkIHRvIHVzZSBgaW5zcGVjdCAuLi4gdHJ1ZWAgdG8gZ2V0CiAgICAlIGZ1bGwgb3V0cHV0LgogICAgKHByaW50IChpbnNwZWN0IChmIDQpIHRydWUpKQogICAgKHByaW50IChpbnNwZWN0IChmIDUpIHRydWUpKQogICAgKHByaW50IChpbnNwZWN0IChmIDYpIHRydWUpKQop" rel="nofollow noreferrer">Try it Online</a> link.</p>


blocks|key|927528|text|WendyScript，34字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|927529|#:(x){<<j=[x]*x#i:1->x+j=[j]*x/>j}
#:(x){<<j=[x]*x#i:1->x+j=[j]*x/>j}(2)+//+[[2,+2],+[2,+2]]|code-block|syntax|javascript|927530|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://felixguo.me/wendy/|1|https://felixguo.me/?code=IzooeCl7PDxqPVt4XSp4I2k6MS0%2BeCBqPVtqXSp4Lz5qfSgyKQ==#wendyScript^0|0|B|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://felixguo.me/wendy/" rel="nofollow noreferrer">WendyScript</a>, 34 bytes</h1>

<pre><code>#:(x){&lt;&lt;j=[x]*x#i:1-&gt;x j=[j]*x/&gt;j}
#:(x){&lt;&lt;j=[x]*x#i:1-&gt;x j=[j]*x/&gt;j}(2) // [[2, 2], [2, 2]]
</code></pre>

<p><a href="https://felixguo.me/?code=IzooeCl7PDxqPVt4XSp4I2k6MS0+eCBqPVtqXSp4Lz5qfSgyKQ==#wendyScript" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|927548|text|12-基本，42字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|927549|A=[N=INPUT()]*N
FOR+I=2TO+N
A=[A]*N
NEXT?A|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>12-basic, 42 bytes</h1>
<pre><code>A=[N=INPUT()]*N
FOR I=2TO N
A=[A]*N
NEXT?A
</code></pre>


blocks|key|927581|text|V，14字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|927582|é,"aPÀñDÀpys0]|code-block|syntax|javascript|927583|在网上试试！|unstyled|927584|输入|927585|é,+++++++++++++++#+write+comma
++"aP++++++++++++#+paste+register+A+(input)
+++++Àñ++++++++++#+loop+À+(number+in+register+A)+times
+++++++D+++++++++#+cut+to+end+of+line
++++++++Àp+++++++#+paste+À+times
++++++++++ysB]+++#+surround+everything+before+comma+in+square+brackets|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DJMcMayhem/V|1|https://tio.run/##K/v///BKHaXEgMMNhze6HG4oqCw2iP3//78JAA^0|0|1|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/DJMcMayhem/V" rel="nofollow noreferrer">V</a>, 14 bytes</h1>

<pre><code>é,"aPÀñDÀpys0]
</code></pre>

<p><a href="https://tio.run/##K/v///BKHaXEgMMNhze6HG4oqCw2iP3//78JAA" rel="nofollow noreferrer" title="V – Try It Online">Try it online!</a></p>

<p>input </p>

<pre><code>é,               # write comma
  "aP            # paste register A (input)
     Àñ          # loop À (number in register A) times
       D         # cut to end of line
        Àp       # paste À times
          ysB]   # surround everything before comma in square brackets
</code></pre>


blocks|key|928105|text|Pip+-p，12字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|928106|YaLaY[y]RLay|code-block|syntax|javascript|928107|在网上试试！|unstyled|928108|解释|928109|YaLaY[y]RLay
Y+++++++++++++Yank+into+the+y+variable
+a++++++++++++the+first+command-line+argument,+a
++La++++++++++Fixed-iterations+loop,+do+the+following+a+times:
+++++[y]+++++++y+wrapped+in+a+list
++++++++RLa++++repeated+a+times+(results+in+a+list+containing+a+copies+of+y)
++++Y++++++++++Yank+that+list+back+into+y
+++++++++++y++After+the+loop,+print+y|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/dloscutoff/pip|1|https://tio.run/##K8gs@P8/MtEnMTK6MjbIJ7Hy////ugX/jQE^0|4|2|0|3|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@$9|11|A|12|B|C]]|D|@$9|13|A|14|1|15]]|E|$]]|$1|F|3|G|5|H|7|16|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|17|8|@]|D|@$9|18|A|19|1|1A]]|E|$]]|$1|N|3|O|5|6|7|1B|8|@]|D|@]|E|$]]|$1|P|3|Q|5|H|7|1C|8|@]|D|@]|E|$I|J]]]|R|$S|$5|T|U|V|E|$W|X]]|Y|$5|T|U|V|E|$W|Z]]]]

<h1><a href="https://github.com/dloscutoff/pip" rel="nofollow noreferrer">Pip</a> <code>-p</code>, 12 bytes</h1>

<pre><code>YaLaY[y]RLay
</code></pre>

<p><a href="https://tio.run/##K8gs@P8/MtEnMTK6MjbIJ7Hy////ugX/jQE" rel="nofollow noreferrer" title="Pip – Try It Online">Try it online!</a></p>

<h3>Explanation</h3>

<pre><code>YaLaY[y]RLay
Y             Yank into the y variable
 a            the first command-line argument, a
  La          Fixed-iterations loop, do the following a times:
     [y]       y wrapped in a list
        RLa    repeated a times (results in a list containing a copies of y)
    Y          Yank that list back into y
           y  After the loop, print y
</code></pre>


blocks|key|6355989|text|因子+%2B+arrays.shaped，39字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|6355990|[+3+dupn+<array>+swap+repeated-shaped+]|code-block|syntax|javascript|6355991|在网上试试！|unstyled|6355992|repeated-shaped获取一系列维度(即形状)和一个元素，并从它们创建一个数组。例如，其余代码将4转换为{+4+4+4+4+}+4。|entityMap|0|LINK|mutability|MUTABLE|url|https://factorcode.org/|1|https://tio.run/##LYy7CsJAFET7fMX8gAs@KhVbsbERq5DikoxmMd6sdzdIFL99DWI1nANnLlKn3vL5dDju17hSadL5lyTfa4SYyRhxoym7P7nYSmCDyMdArRkRjCmNwbwm@B6bonhjjgWWWOGTy2mbISi2v36H@JQAY6AkNrP/W5Xvky3hnIN2qECp2/wF^0|5|D|0|2|0|0|0|0|6|1|0|0|F|1G|1|1K|D^^$0|@$1|2|3|4|5|6|7|Y|8|@$9|Z|A|10|B|C]]|D|@$9|11|A|12|1|13]]|E|$]]|$1|F|3|G|5|H|7|14|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|15|8|@]|D|@$9|16|A|17|1|18]]|E|$]]|$1|N|3|O|5|M|7|19|8|@$9|1A|A|1B|B|C]|$9|1C|A|1D|B|C]|$9|1E|A|1F|B|C]]|D|@]|E|$]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|R|S|T|E|$U|X]]]]

<h1><a href="https://factorcode.org/" rel="nofollow noreferrer">Factor</a> + <code>arrays.shaped</code>, 39 bytes</h1>
<pre><code>[ 3 dupn &lt;array&gt; swap repeated-shaped ]
</code></pre>
<p><a href="https://tio.run/##LYy7CsJAFET7fMX8gAs@KhVbsbERq5DikoxmMd6sdzdIFL99DWI1nANnLlKn3vL5dDju17hSadL5lyTfa4SYyRhxoym7P7nYSmCDyMdArRkRjCmNwbwm@B6bonhjjgWWWOGTy2mbISi2v36H@JQAY6AkNrP/W5Xvky3hnIN2qECp2/wF" rel="nofollow noreferrer" title="Factor – Try It Online">Try it online!</a></p>
<p><code>repeated-shaped</code> Takes a sequence of dimensions (i.e. a shape) and an element and creates an array from them. The rest of the code turns <code>4</code> into <code>{ 4 4 4 4 } 4</code>, for example.</p>


blocks|key|6356226|text|果冻，3字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|6356227|ḷⱮ¡|code-block|syntax|javascript|6356228|在网上试试！|unstyled|6356229|就像林恩的解决方案极大地启发了这一点，一个完整的程序只。|6356230|++¡++++Repeat+[input]+times,+starting+with+the+input+on+the+left+and+right:
+Ɱ+++++Produce+an+array+containing,+for+every+element+of+the+right+argument,
ḷ++++++the+left+argument.|6356231|尽管并进¡不是重用其右参数，而是在每次后续迭代中使用先前的左参数，但在这种情况下，这两种行为都会执行相同的操作--因为每个中间结果的长度与(隐式分级的)初始输入相同。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/##y0rNyan8///hju2PNq47tPD///8mAA^0|0|2|0|0|0|0|6|1|0|0|0|4|1^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|L|3|M|5|K|7|1B|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1C|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|1D|8|@$A|1E|B|1F|R|S]]|9|@]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a>, 3 bytes</h1>
<pre><code>ḷⱮ¡
</code></pre>
<p><a href="https://tio.run/##y0rNyan8///hju2PNq47tPD///8mAA" rel="nofollow noreferrer" title="Jelly – Try It Online">Try it online!</a></p>
<p>Like Lynn's solution which heavily inspired this, a full program only.</p>
<pre><code>  ¡    Repeat [input] times, starting with the input on the left and right:
 Ɱ     Produce an array containing, for every element of the right argument,
ḷ      the left argument.
</code></pre>
<p>Although dyadic <code>¡</code>, rather than reusing its right argument, uses the previous left argument for each successive iteration, in this case either behavior would do the same thing--since each intermediate result has the same length as the (implicitly rangified) initial input.</p>


blocks|key|928304|text|帕里/GP，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|928305|n->for(i=1,a=n,a=vector(n,x,a));a|code-block|syntax|javascript|928306|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://pari.math.u-bordeaux.fr/|1|https://tio.run/##FYlBCoAwDAS/Ejw1kB4K3iT9SxBbcomlFPH3MR52YGaHTM19eAN2y7XdMykXErbYc50rgtFLgniI/7cBQyHYCcZUW@Eb5BpoyRDRPw^0|0|5|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://pari.math.u-bordeaux.fr/" rel="nofollow noreferrer">Pari/GP</a>, 33 bytes</h1>
<pre><code>n-&gt;for(i=1,a=n,a=vector(n,x,a));a
</code></pre>
<p><a href="https://tio.run/##FYlBCoAwDAS/Ejw1kB4K3iT9SxBbcomlFPH3MR52YGaHTM19eAN2y7XdMykXErbYc50rgtFLgniI/7cBQyHYCcZUW@Eb5BpoyRDRPw" rel="nofollow noreferrer" title="Pari/GP – Try It Online">Try it online!</a></p>


blocks|key|928504|text|维沙尔，2字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|928505|(ẋ|code-block|syntax|javascript|928506|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://vyxal.pythonanywhere.com/#WyIiLCIiLCIo4bqLIiwiIiwiMyJd^0|0|3|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://github.com/Vyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a>, 2 bytes</h1>
<pre><code>(ẋ
</code></pre>
<p><a href="https://vyxal.pythonanywhere.com/#WyIiLCIiLCIo4bqLIiwiIiwiMyJd" rel="nofollow noreferrer">Try it Online!</a></p>


blocks|key|928550|text|去，150个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|928551|func+f(n+int)[]any{return+g(n,n)}
func+g(n,d+int)(L[]any){if+d<1{return}
for+i:=0;i<n;i%2B%2B{var+e+any
if+d<2{e=n}else{e=g(n,d-1)}
L=append(L,e)}
return}|code-block|syntax|javascript|928552|在网上试试！|unstyled|928553|打电话给f(n)。返回一个[]any，它可以转换为f(n).([]int)、f(n).([][]int)、f(n).([][][]int)、f(n).([][][][]int)等。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://go.dev/|1|https://ato.pxeger.com/run?1=RY9NasMwEIX3OsVgCEjYCUmhEBKru-y86D7tQsSSGVqPjSoHivA1ssnGFHqIHqW36UQ1ZDN_fLz35vrVdNNPb05vprHQGiSBbd_5sMpcG7LvIbjl9vfiBjqBkwRIQR1fDX1Gb8PgCRpJBalRJOK21ImRVaJURAd1uZlpxjoPuNPrPZa0xzyPZ-PBAqMikQ_Rahrt-4flIcktN6xeadP3lmpZFZbXWW1Od0jet-xSQbxbAJb6kWue8_XZcywns0UN-gkW5xfKCsCCn0KlxChmsWn6738^0|0|1|0|0|0|0|6|1|0|4|4|D|5|P|C|12|E|1H|G|1Y|I^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@$A|18|B|19|N|O]|$A|1A|B|1B|N|O]|$A|1C|B|1D|N|O]|$A|1E|B|1F|N|O]|$A|1G|B|1H|N|O]|$A|1I|B|1J|N|O]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]


<h1><a href="https://go.dev" rel="nofollow noreferrer">Go</a>, 150 bytes</h1>
<pre class="lang-go prettyprint-override"><code>func f(n int)[]any{return g(n,n)}
func g(n,d int)(L[]any){if d&lt;1{return}
for i:=0;i&lt;n;i++{var e any
if d&lt;2{e=n}else{e=g(n,d-1)}
L=append(L,e)}
return}
</code></pre>
<p><a href="https://ato.pxeger.com/run?1=RY9NasMwEIX3OsVgCEjYCUmhEBKru-y86D7tQsSSGVqPjSoHivA1ssnGFHqIHqW36UQ1ZDN_fLz35vrVdNNPb05vprHQGiSBbd_5sMpcG7LvIbjl9vfiBjqBkwRIQR1fDX1Gb8PgCRpJBalRJOK21ImRVaJURAd1uZlpxjoPuNPrPZa0xzyPZ-PBAqMikQ_Rahrt-4flIcktN6xeadP3lmpZFZbXWW1Od0jet-xSQbxbAJb6kWue8_XZcywns0UN-gkW5xfKCsCCn0KlxChmsWn6738" rel="nofollow noreferrer">Attempt This Online!</a></p>
<p>Call with <code>f(n)</code>. Returns an <code>[]any</code>, that can be casted to a <code>f(n).([]int)</code>,<code>f(n).([][]int)</code>,<code>f(n).([][][]int)</code>,<code>f(n).([][][][]int)</code>, etc.</p>


blocks|key|928603|text|BQN，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|928604|⥊˜⥊⊢|code-block|syntax|javascript|928605|匿名默示函数；接受一个整数并返回一个N维数组。在BQN网上试试吧！|unstyled|928606|解释|928607|与丹尼斯的APL回答完全相同，尽管它们是独立派生的。|928608|重塑内置⥊在左边采用一个形状(整数维列表)，在右边采用一个值数组。它创建一个给定形状的数组，填充来自原始数组的值。如果任何一个参数都是空整数，则将其提升为包含该整数的列表。|style|CODE|928609|关于示例参数3：|928610|⥊˜用自己作为形状来重塑论点。结果是一个3's：⟨+3+3+3+⟩的三维一维阵列.|928611|⊢返回不变的参数：3。|928612|因此，⥊˜+⥊+⊢等价于⟨+3+3+3+⟩+⥊+3：将3重塑为3×3×3数组。|entityMap|0|LINK|mutability|MUTABLE|url|https://mlochbaum.github.io/BQN/|1|https://mlochbaum.github.io/BQN/try.html#code=RiDihpAg4qWKy5zipYriiqIKCkYgMw==|2|https://codegolf.stackexchange.com/a/111691/16766|3|https://mlochbaum.github.io/BQN/doc/reshape.html#reshape^0|0|3|0|0|0|N|A|1|0|0|1|9|2|0|4|1|0|2|3|0|0|0|2|O|9|0|0|1|9|1|0|3|6|C|D|R|1^^$0|@$1|2|3|4|5|6|7|1E|8|@]|9|@$A|1F|B|1G|1|1H]]|C|$]]|$1|D|3|E|5|F|7|1I|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|L|3|M|5|6|7|1N|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1O|8|@]|9|@$A|1P|B|1Q|1|1R]]|C|$]]|$1|P|3|Q|5|K|7|1S|8|@$A|1T|B|1U|R|S]]|9|@$A|1V|B|1W|1|1X]]|C|$]]|$1|T|3|U|5|K|7|1Y|8|@]|9|@]|C|$]]|$1|V|3|W|5|K|7|1Z|8|@$A|20|B|21|R|S]|$A|22|B|23|R|S]]|9|@]|C|$]]|$1|X|3|Y|5|K|7|24|8|@$A|25|B|26|R|S]|$A|27|B|28|R|S]]|9|@]|C|$]]|$1|Z|3|10|5|K|7|29|8|@$A|2A|B|2B|R|S]|$A|2C|B|2D|R|S]|$A|2E|B|2F|R|S]]|9|@]|C|$]]]|11|$12|$5|13|14|15|C|$16|17]]|18|$5|13|14|15|C|$16|19]]|1A|$5|13|14|15|C|$16|1B]]|1C|$5|13|14|15|C|$16|1D]]]]

<h1><a href="https://mlochbaum.github.io/BQN/" rel="nofollow noreferrer">BQN</a>, 4 bytes</h1>
<pre><code>⥊˜⥊⊢
</code></pre>
<p>Anonymous tacit function; takes an integer and returns an N-dimensional array. <a href="https://mlochbaum.github.io/BQN/try.html#code=RiDihpAg4qWKy5zipYriiqIKCkYgMw==" rel="nofollow noreferrer">Try it at BQN online!</a></p>
<h3>Explanation</h3>
<p>Exactly the same as <a href="https://codegolf.stackexchange.com/a/111691/16766">Dennis's APL answer</a>, though independently derived.</p>
<p>The <a href="https://mlochbaum.github.io/BQN/doc/reshape.html#reshape" rel="nofollow noreferrer">Reshape</a> builtin <code>⥊</code> takes a shape (list of integer dimensions) on the left and an array of values on the right. It creates an array of the given shape, filled with values taken from the original array. If either argument is a bare integer, it is promoted to a list containing that integer.</p>
<p>With example argument 3:</p>
<p><code>⥊˜</code> reshapes the argument with itself as the shape. The result is a 3-element 1-dimensional array of 3's: <code>⟨ 3 3 3 ⟩</code>.</p>
<p><code>⊢</code> returns the argument unchanged: <code>3</code>.</p>
<p>So <code>⥊˜ ⥊ ⊢</code> is equivalent to <code>⟨ 3 3 3 ⟩ ⥊ 3</code>: reshape <code>3</code> into a 3 by 3 by 3 array.</p>


blocks|key|6355726|text|Lua，85字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|6355727|function+f(n,d,x)d=d+or+2+x={}for+i=1,n+do+x[i]=d>n+and+n+or+f(n,d%2B1)end+return+x+end|code-block|syntax|javascript|6355728|在网上试试！|unstyled|offset|length|6355729|(+TIO链接包含一些额外的代码来打印表，因为Lua没有内置的打印表内容的方法)|6355730|解释|6355731|function+f(n,+d,+x)
++d+=+d+or+2
++x+=+{}
++for+i+=+1,+n+do
++++x[i]+=+d+>+n+and+n+or+f(n,+d+%2B+1)
++end
++return+x
end|6355732|正如您可能看到的，f是一个递归函数，它将数字N作为n，以及另外两个参数d和x。d是深度，在初始调用中不使用，在这种情况下，它默认为2。x实际上不是用作参数，而是因为函数需要一个临时局部变量，并且将其声明为参数比使用local关键字更短。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##dVBBbsMgELz7FSNOoCKraW@V6EeqHkiBFMVdW3htuYrydhcoSU@9rJaZnZldhsXue1jog@NICJK005tyxmFMeMJmLteQu2gOmuBGbG/x3bhXgiUHKkNV83BQPgPJ85IIG/Kj6@62PKVILPk4aERynlh1QAygkRsA/vR06w0eqwNQss8aa2Yw2ZjmYqLyIpmr7JdljnTKkplzyKlPfpICEPck9D3OpYgXiCrLwfw9ebkqGAPB9jh4UReoNPC77p@7ani7Y71556sr44fZ/yMtwWubqheVWn@nmQX5rNS@/wA^0|0|0|0|6|0|0|0|0|0|9|1|P|1|Z|1|11|1|13|1|1V|1|2Z|5^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|13|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|14|8|@]|9|@$J|15|K|16|1|17]]|A|$]]|$1|L|3|M|5|I|7|18|8|@]|9|@]|A|$]]|$1|N|3|O|5|6|7|19|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|1A|8|@]|9|@]|A|$E|F]]|$1|R|3|S|5|I|7|1B|8|@$J|1C|K|1D|T|U]|$J|1E|K|1F|T|U]|$J|1G|K|1H|T|U]|$J|1I|K|1J|T|U]|$J|1K|K|1L|T|U]|$J|1M|K|1N|T|U]|$J|1O|K|1P|T|U]]|9|@]|A|$]]]|V|$W|$5|X|Y|Z|A|$10|11]]]]

<h1>Lua, 85 bytes</h1>

<pre><code>function f(n,d,x)d=d or 2 x={}for i=1,n do x[i]=d&gt;n and n or f(n,d+1)end return x end
</code></pre>

<p><a href="https://tio.run/##dVBBbsMgELz7FSNOoCKraW@V6EeqHkiBFMVdW3htuYrydhcoSU@9rJaZnZldhsXue1jog@NICJK005tyxmFMeMJmLteQu2gOmuBGbG/x3bhXgiUHKkNV83BQPgPJ85IIG/Kj6@62PKVILPk4aERynlh1QAygkRsA/vR06w0eqwNQss8aa2Yw2ZjmYqLyIpmr7JdljnTKkplzyKlPfpICEPck9D3OpYgXiCrLwfw9ebkqGAPB9jh4UReoNPC77p@7ani7Y71556sr44fZ/yMtwWubqheVWn@nmQX5rNS@/wA" rel="nofollow noreferrer" title="Lua – Try It Online">Try it online!</a></p>

<p>(The TIO link contains a bit of extra code to print the table as Lua has no built-in way of printing a table's contents)</p>

<h2>Explanation</h2>

<pre><code>function f(n, d, x)
  d = d or 2
  x = {}
  for i = 1, n do
    x[i] = d &gt; n and n or f(n, d + 1)
  end
  return x
end
</code></pre>

<p>As you can probably see, <code>f</code> is a recursive function which takes the number N as <code>n</code>, and two other arguments, <code>d</code> and <code>x</code>. <code>d</code> is the depth, and is not used in the initial call, in which case it defaults to 2. <code>x</code> is not actually used as a parameter, but is there because the function requires a temporary local variable, and it is shorter to declare it as a parameter than to use the <code>local</code> keyword.</p>


<p><strong>In:</strong>&emsp;Enough memory and a positive integer N</p>

<p><strong>Out:</strong>&emsp;N-dimensional N^N array filled with N, where N^N means N terms of N-by-N-by-N-by...</p>

<p><strong>Examples:</strong></p>

<p>1: <code>[1]</code> which is a 1D array (a list) of length 1, containing a single 1</p>

<p>2: <code>[[2,2],[2,2]]</code> which is a 2D array (a table) with 2 rows and 2 columns, filled with 2s</p>

<p>3: <code>[[[3,3,3],[3,3,3],[3,3,3]],[[3,3,3],[3,3,3],[3,3,3]],[[3,3,3],[3,3,3],[3,3,3]]]</code> which is a 3D array (a cube) with 3 layers, 3 rows, and 3 columns, filled with 3s</p>

<p>4: <code>[[[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]]],[[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]]],[[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]]],[[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]],[[4,4,4,4],[4,4,4,4],[4,4,4,4],[4,4,4,4]]]]
</code></p>

<p>5 and 6: Please see one of the answers.</p>


N-dimensional N^N array filled with N

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

In： 足够内存和正整数N输出： N维N^N阵列填充N，其中N^N表示N-by N-by-N-by-N-by.示例：1：[1]是长度为1的一维数组(列表)，包含单个12：[[2,2],[2,2]]是一个2行2列的2D数组(一个表)，填充2s3：[[[3,3,3],[3,3,3],[3,3,3]],[[3,3,3],[3,3,3],[3,3,3]],[[3,3,3],[3,3,3],[3,3,3]]

问N维N^N阵列
EN

示例：

回答 33

Code Golf用户

Dyalog APL，4字节

Code Golf用户

R，26

Code Golf用户

哈斯克尔，52字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问N维N^N阵列EN

示例：

回答 33

Code Golf用户

Dyalog APL，4字节

Code Golf用户

R，26

Code Golf用户

哈斯克尔，52字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问N维N^N阵列
EN