blocks|key|1297290|text|05AB1E，2字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1297291|Aƶ|code-block|syntax|javascript|1297292|在网上试试！|1297293|注意，这输出为行列表，这是OP显式允许的。该链接使用了一个带有漂亮打印(由换行符加入)的版本。|unstyled|1297294|是如何工作的|1297295|A生成小写字母。|unordered-list-item|style|CODE|1297296|ƶ提升字母表(将每个元素乘以其索引)。|1297297|»通过换行符加入。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##MzBNTDJM/f/f8di2/4d2/wcA^0|0|6|0|0|0|0|6|1|0|0|0|0|1|0|0|1|0|0|1^^$0|@$1|2|3|4|5|6|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|D|3|E|5|F|7|1B|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]|$1|K|3|L|5|M|7|1G|8|@]|9|@]|C|$]]|$1|N|3|O|5|6|7|1H|8|@]|9|@]|C|$]]|$1|P|3|Q|5|R|7|1I|8|@$A|1J|B|1K|S|T]]|9|@]|C|$]]|$1|U|3|V|5|R|7|1L|8|@$A|1M|B|1N|S|T]]|9|@]|C|$]]|$1|W|3|X|5|R|7|1O|8|@$A|1P|B|1Q|S|T]]|9|@]|C|$]]]|Y|$Z|$5|10|11|12|C|$13|14]]|15|$5|10|11|12|C|$13|16]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E" rel="noreferrer">05AB1E</a>, 2 bytes</h1>
<pre><code>Aƶ
</code></pre>
<p><strong><a href="https://tio.run/##MzBNTDJM/f/f8di2/4d2/wcA" rel="noreferrer" title="05AB1E – Try It Online">Try it online!</a></strong></p>
<p>Note that this outputs as a list of lines, as the OP explicitly allowed. The link uses a version with pretty-print (joined by newlines).</p>
<h2>How it works</h2>
<ul>
<li><code>A</code> yields the lowercase alphabet.</li>
<li><code>ƶ</code> lifts the alphabet (multiplies each element by its index).</li>
<li><code>»</code> joins by newlines.</li>
</ul>


blocks|key|157574|text|Python+2，36字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|157575|i=1
exec'print+chr(i%2B96)*i;i%2B=1;'*26|code-block|syntax|javascript|157576|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##K6gsycjPM/r/P9PWkCu1IjVZvaAoM69EITmjSCNT29JMUyvTOlPb1tBaXcvI7P9/AA^0|0|8|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://docs.python.org/2/" rel="noreferrer">Python 2</a>, 36 bytes</h1>



<pre class="lang-python prettyprint-override"><code>i=1
exec'print chr(i+96)*i;i+=1;'*26
</code></pre>

<p><a href="https://tio.run/##K6gsycjPM/r/P9PWkCu1IjVZvaAoM69EITmjSCNT29JMUyvTOlPb1tBaXcvI7P9/AA" rel="noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>


blocks|key|1296479|text|脑盘，74字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1296480|%2B%2B%2B%2B%2B%2B%2B%2B[>%2B>%2B%2B%2B>%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B<<<-]>%2B%2B>%2B%2B>%2B>%2B<<[->>[->%2B<<.>]>[-<%2B>]<%2B<%2B<<.>]|code-block|syntax|javascript|1296481|在网上试试！|unstyled|1296482|解释|1296483|%2B%2B%2B%2B%2B%2B%2B%2B[>%2B>%2B%2B%2B>%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B%2B<<<-]>%2B%2B>%2B%2B>%2B>%2B
TAPE:
++000
++010+++C_NEWLINE
++026+++V_ITERCOUNT
++097+++V_ALPHA
+>001<++V_PRINTCOUNT
++000+++T_PRINTCOUNT

V_ITERCOUNT+TIMES:++++++<<[-+++

++V_PRINTCOUNT+TIMES:+++++>>[-
++++INC+T_PRINTCOUNT++++++++>%2B
++++OUTPUT+V_ALPHA++++++++++<<.
++++++++++++++++++++++++++>]

++RESTORE+V_PRINTCOUNT++++>[-<%2B>]
++INC+V_PRINTCOUNT++++++++<%2B
++INC+V_ALPHA+++++++++++++<%2B
++OUTPUT+C_NEWLINE++++++++<<.
++++++++++++++++++++++++>]|1296484|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/TryItOnline/brainfuck|1|https://tio.run/##SypKzMxLK03O/v9fGwqi7bTtgJSdNhKwsbHRjbUDC4JkbWyide3sgBjI0rOLBbJstO1ibbRtIPz//wE|2|https://tio.run/##jVBBCsIwELznFXsPlehBUZaFUgIGNC11q4dSRAVBBA@C76/ZWksrCs6hm84sM5Mc74fL7fw4XetatyhJUxike0DEqKKGFFVxnNmFAjDGyHdsACDZe7tbOW@FmUwDs907tnmSFp6Fm88aLl5ly1gBGTNG@c9y57lbMmLFfVL1bIDd2m4W0ACxjMJQaujS3yEqIyUH55OBK7QId5GRFpwV/C4HHRBHCn6CKsnO7YbT3A47iFpGqMPKK3z7JRx1J37kvsW2V/e0//Siqq6f^0|0|2|0|0|0|0|6|1|0|0|0|0|6|2^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|D|3|E|5|F|7|15|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]|$1|L|3|M|5|6|7|1A|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1B|8|@]|9|@]|C|$G|H]]|$1|P|3|J|5|K|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]]|Q|$R|$5|S|T|U|C|$V|W]]|X|$5|S|T|U|C|$V|Y]]|Z|$5|S|T|U|C|$V|10]]]]

<h1><a href="https://github.com/TryItOnline/brainfuck" rel="noreferrer">brainfuck</a>, 74 bytes</h1>

<pre><code>++++++++[&gt;+&gt;+++&gt;++++++++++++&lt;&lt;&lt;-]&gt;++&gt;++&gt;+&gt;+&lt;&lt;[-&gt;&gt;[-&gt;+&lt;&lt;.&gt;]&gt;[-&lt;+&gt;]&lt;+&lt;+&lt;&lt;.&gt;]
</code></pre>

<p><a href="https://tio.run/##SypKzMxLK03O/v9fGwqi7bTtgJSdNhKwsbHRjbUDC4JkbWyide3sgBjI0rOLBbJstO1ibbRtIPz//wE" rel="noreferrer" title="brainfuck – Try It Online">Try it online!</a></p>

<h2>Explanation</h2>

<pre><code>++++++++[&gt;+&gt;+++&gt;++++++++++++&lt;&lt;&lt;-]&gt;++&gt;++&gt;+&gt;+
TAPE:
  000
  010   C_NEWLINE
  026   V_ITERCOUNT
  097   V_ALPHA
 &gt;001&lt;  V_PRINTCOUNT
  000   T_PRINTCOUNT

V_ITERCOUNT TIMES:      &lt;&lt;[-   

  V_PRINTCOUNT TIMES:     &gt;&gt;[-
    INC T_PRINTCOUNT        &gt;+
    OUTPUT V_ALPHA          &lt;&lt;.
                          &gt;]

  RESTORE V_PRINTCOUNT    &gt;[-&lt;+&gt;]
  INC V_PRINTCOUNT        &lt;+
  INC V_ALPHA             &lt;+
  OUTPUT C_NEWLINE        &lt;&lt;.
                        &gt;]
</code></pre>

<p><a href="https://tio.run/##jVBBCsIwELznFXsPlehBUZaFUgIGNC11q4dSRAVBBA@C76/ZWksrCs6hm84sM5Mc74fL7fw4XetatyhJUxike0DEqKKGFFVxnNmFAjDGyHdsACDZe7tbOW@FmUwDs907tnmSFp6Fm88aLl5ly1gBGTNG@c9y57lbMmLFfVL1bIDd2m4W0ACxjMJQaujS3yEqIyUH55OBK7QId5GRFpwV/C4HHRBHCn6CKsnO7YbT3A47iFpGqMPKK3z7JRx1J37kvsW2V/e0//Siqq6f" rel="noreferrer" title="brainfuck – Try It Online">Try it online!</a></p>


blocks|key|158276|text|JavaScript+(ES6)，54字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|158277|f=(n=9)=>%2B%2Bn<36?n.toString(36).repeat(n-9)%2B`
`%2Bf(n):''

O.innerText+=+f()|code-block|syntax|javascript|158278|<pre+id=O></pre>|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|K|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|D|7|L|8|@]|9|@]|A|$E|F]]]|I|$]]

<h1>JavaScript (ES6), 54 bytes</h1>
<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>f=(n=9)=&gt;++n&lt;36?n.toString(36).repeat(n-9)+`
`+f(n):''

O.innerText = f()</code></pre>
<pre class="snippet-code-html lang-html prettyprint-override"><code>&lt;pre id=O&gt;&lt;/pre&gt;</code></pre>
</div>
</div>
</p>


blocks|key|159420|text|Excel，38字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|159421|使用即时窗口。:)|unstyled|159422|[A1:A26]="=REPT(CHAR(96%2BROW()),ROW())"|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|$]]

<p><strong>Excel VBA, 38 bytes</strong></p>
<p>Using Immediate Window. :)</p>
<pre><code>[A1:A26]=&quot;=REPT(CHAR(96+ROW()),ROW())&quot;
</code></pre>


blocks|key|1296038|text|Ruby，38字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1296039|返回字符串数组|unstyled|1296040|->{(a=*?a..?z).map{%7Cx%7Cx*-~a.index(x)}}|code-block|syntax|javascript|1296041|-5字节，这要感谢全人类|1296042|*-11字节，这要归功于乔丹打高尔夫球的能力。|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|Q|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|D|7|S|8|@]|9|@]|A|$]]]|N|$]]

<h1>Ruby, 38 bytes</h1>

<p>Returns an Array of strings</p>

<pre><code>-&gt;{(a=*?a..?z).map{|x|x*-~a.index(x)}}
</code></pre>

<p><em>-5 bytes thanks to totallyhuman</em></p>

<p>*-11 bytes thanks to some excellent golfing by Jordan.</p>


blocks|key|157656|text|V，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|157657|¬az\ÓÎÛäl|code-block|syntax|javascript|157658|在网上试试！|unstyled|157659|六角山：|157660|00000000:+ac61+7a5c+d3ce+dbe4+6c+++++++++++++++++++.az\....l|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DJMcMayhem/V|1|https://tio.run/##K/v//9CaxKqYw5MP9x2efXhJzv//AA^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>, 9 bytes</h1>

<pre><code>¬az\ÓÎÛäl
</code></pre>

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

<p>Hexdump:</p>

<pre><code>00000000: ac61 7a5c d3ce dbe4 6c                   .az\....l
</code></pre>


blocks|key|158011|text|马蒂尔，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|158012|2Y2"@X@Y"|code-block|syntax|javascript|158013|在网上试试！|unstyled|158014|解释|158015|2Y2+++++%25+Push+string+'abc...z'
"+++++++%25+For+char+in+that+string+each
++@+++++%25+++Push+current+char
++X@++++%25+++Push+iteration+index+(1-based)
++Y"++++%25+++Run-length+decoding:+repeat+char+that+many+times
++++++++%25+Implicit+end.+Implicit+display|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lmendo/MATL|1|https://tio.run/##y00syfn/3yjSSMkhwiFS6f9/AA^0|0|3|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/lmendo/MATL" rel="nofollow noreferrer">MATL</a>, 9 bytes</h1>
<pre><code>2Y2&quot;@X@Y&quot;
</code></pre>
<p><a href="https://tio.run/##y00syfn/3yjSSMkhwiFS6f9/AA" rel="nofollow noreferrer" title="MATL – Try It Online"><strong>Try it online!</strong></a></p>
<h3>Explanation</h3>
<pre><code>2Y2     % Push string 'abc...z'
&quot;       % For char in that string each
  @     %   Push current char
  X@    %   Push iteration index (1-based)
  Y&quot;    %   Run-length decoding: repeat char that many times
        % Implicit end. Implicit display
</code></pre>


blocks|key|1296138|text|Python+3，37字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1296139|for+k+in+range(27):print(chr(k%2B96)*k)|code-block|syntax|javascript|1296140|打印一个前导换行符(这是允许的)。|unstyled|1296141|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##K6gsycjPM/7/Py2/SCFbITNPoSgxLz1Vw8hc06qgKDOvRCM5o0gjW9vSTFMrW/P/fwA^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|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@]|C|$]]|$1|L|3|M|5|K|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/3/" rel="nofollow noreferrer">Python 3</a>, 37 bytes</h1>



<pre class="lang-python prettyprint-override"><code>for k in range(27):print(chr(k+96)*k)
</code></pre>

<p>Prints a leading newline (which is allowed).</p>

<p><a href="https://tio.run/##K6gsycjPM/7/Py2/SCFbITNPoSgxLz1Vw8hc06qgKDOvRCM5o0gjW9vSTFMrW/P/fwA" rel="nofollow noreferrer" title="Python 3 – Try It Online"><strong>Try it online!</strong></a></p>


blocks|key|1298188|text|马蒂尔，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1298189|2Y2t!g*!YRc|code-block|syntax|javascript|1298190|在网上试试！|unstyled|1298191|使用广播乘法与1，以得到一个大的正方形26x26矩阵所需的字母。接下来，取下三角形部分，并隐式打印。|1298192|也有11个字节：|1298193|2Y2!t~!%2BYRc++%25+Using+broadcast+addition+with+zeroes
2Y2!l26X"YR++%25+Using+'repmat'|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lmendo/MATL|1|https://tio.run/##y00syfn/3yjSqEQxXUsxMij5v6pjTnG@gqGhQlJlSWoxFxdQTrGkTlEbKAdm5xiZRShFBv0HAA^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/lmendo/MATL" rel="nofollow noreferrer">MATL</a>, 11 bytes</h1>

<pre><code>2Y2t!g*!YRc
</code></pre>

<p><a href="https://tio.run/##y00syfn/3yjSqEQxXUsxMij5v6pjTnG@gqGhQlJlSWoxFxdQTrGkTlEbKAdm5xiZRShFBv0HAA" rel="nofollow noreferrer" title="MATL – Try It Online">Try it online!</a></p>

<p>Uses broadcast multiplication with ones to get a big square 26x26 matrix of the desired letters. Next, the lower triangular part is taken, and implicitly printed.</p>

<p>Also 11 bytes:</p>

<pre><code>2Y2!t~!+YRc  % Using broadcast addition with zeroes
2Y2!l26X"YR  % Using 'repmat'
</code></pre>


blocks|key|157903|text|哈斯克尔，31字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|157904|-12字节，多亏了nimi。|unstyled|157905|zipWith+replicate[1..26]['a'..]|code-block|syntax|javascript|157906|在网上试试！|157907|这不是一个片段，它是一个延髓函数(一个不带参数的函数)，它输出一个由于元共识而允许的行列表。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/##BcExDoAgDADAr3QwYZJEBzde4eCgDg0BbaykkbL4eOvdifVKzJbDZi/JQnrCk4QpoqZ18H6c9tWh8363G6lAAGk66wMdtMJUUoVsX8yMR7U@ivw|2|https://codegolf.meta.stackexchange.com/a/12945/68615^0|0|4|0|0|0|0|0|6|1|0|Z|3|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|$]]|$1|G|3|H|5|I|7|15|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]|$1|N|3|O|5|F|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]]]]

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

<p><em>-12 bytes thanks to nimi.</em></p>



<pre class="lang-hs prettyprint-override"><code>zipWith replicate[1..26]['a'..]
</code></pre>

<p><a href="https://tio.run/##BcExDoAgDADAr3QwYZJEBzde4eCgDg0BbaykkbL4eOvdifVKzJbDZi/JQnrCk4QpoqZ18H6c9tWh8363G6lAAGk66wMdtMJUUoVsX8yMR7U@ivw" rel="nofollow noreferrer" title="Haskell – Try It Online">Try it online!</a></p>

<p>This is not a snippet, it is a <em>nullary function</em> (one that takes no arguments) that outputs a list of lines which is allowed because of <a href="https://codegolf.meta.stackexchange.com/a/12945/68615">this meta consensus</a>.</p>


blocks|key|1296001|text|Pip，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1296002|FczPcX%2B%2Bi|code-block|syntax|javascript|1296003|在网上试试！|unstyled|1296004|在伪码中，这是|1296005|For-each+c+in+z
++++Print+(c+string-multiply+%2B%2Bi)|1296006|其中，z预置为小写字母，而i预置为0。|style|CODE|1296007|基于地图的解决方案需要额外的一个字节，因为它们需要在多行上显示-n标志：|1296008|{aX%2B%2Bi}Mz
B+X_%2B1MEz|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/dloscutoff/pip|1|https://tio.run/##K8gs@P/fLbkqIDlCWzvz/38A^0|0|3|0|0|0|0|6|1|0|0|0|3|1|D|1|0|V|2|0^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]|$1|D|3|E|5|F|7|1A|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|L|3|M|5|K|7|1F|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1G|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|1H|8|@$A|1I|B|1J|R|S]|$A|1K|B|1L|R|S]]|9|@]|C|$]]|$1|T|3|U|5|K|7|1M|8|@$A|1N|B|1O|R|S]]|9|@]|C|$]]|$1|V|3|W|5|F|7|1P|8|@]|9|@]|C|$G|H]]]|X|$Y|$5|Z|10|11|C|$12|13]]|14|$5|Z|10|11|C|$12|15]]]]

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

<pre><code>FczPcX++i
</code></pre>

<p><a href="https://tio.run/##K8gs@P/fLbkqIDlCWzvz/38A" rel="nofollow noreferrer" title="Pip – Try It Online">Try it online!</a></p>

<p>In pseudocode, this is</p>

<pre><code>For-each c in z
    Print (c string-multiply ++i)
</code></pre>

<p>where <code>z</code> is preset to the lowercase alphabet and <code>i</code> is preset to 0.</p>

<hr>

<p>Map-based solutions take one extra byte because they need the <code>-n</code> flag to display on multiple lines:</p>

<pre><code>{aX++i}Mz
B X_+1MEz
</code></pre>


blocks|key|1296076|text|行政协调会！！，66字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1296077|Count+i+while+26-i+{
Count+j+while+i%2B1-j+{
Write+97%2Bi
}
Write+10
}|code-block|syntax|javascript|1296078|在网上试试！|unstyled|1296079|带注释的|1296080|(|1296081|)|1296082|#+Loop+i+from+0+to+25
Count+i+while+26-i+{
++++#+Loop+j+from+0+to+i+(inclusive)
++++Count+j+while+i%2B1-j+{
++++++++#+Print+a+letter
++++++++Write+97%2Bi
++++}
++++#+Print+a+newline
++++Write+10
}|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/dloscutoff/Esolangs/tree/master/Acc!!|1|https://tio.run/##S0xOTkr6/985vzSvRCFToTwjMydVwchMN1OhmgsimAUVzNQ21M0CioYXZZakKliaa2dy1UI5hgZctf//AwA^0|0|7|0|0|0|0|6|1|0|0|0|0^^$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|6|7|1C|8|@]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1D|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1E|8|@]|9|@]|C|$G|H]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]]]

<h1><a href="https://github.com/dloscutoff/Esolangs/tree/master/Acc!!" rel="nofollow noreferrer"><em>Acc!!</em></a>, 66 bytes</h1>

<pre><code>Count i while 26-i {
Count j while i+1-j {
Write 97+i
}
Write 10
}
</code></pre>

<p><a href="https://tio.run/##S0xOTkr6/985vzSvRCFToTwjMydVwchMN1OhmgsimAUVzNQ21M0CioYXZZakKliaa2dy1UI5hgZctf//AwA" rel="nofollow noreferrer" title="Acc!! – Try It Online">Try it online!</a></p>

<h3>With comments</h3>

<pre><code># Loop i from 0 to 25
Count i while 26-i {
    # Loop j from 0 to i (inclusive)
    Count j while i+1-j {
        # Print a letter
        Write 97+i
    }
    # Print a newline
    Write 10
}
</code></pre>


blocks|key|1296217|text|Java+(OpenJDK+8)，74字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1296218|n->{for(int+i=1,j=0;i<27;)System.out.printf("%25c",j%2B%2B<i?96%2Bi:10%2B(j-=%2B%2Bi));}|code-block|syntax|javascript|1296219|在网上试试！|unstyled|1296220|感谢@KevinCruijssen保存了6个字节|1296221|解释|1296222|n->{++++++++++++++++++++++//+Lambda,+unused+parameter
+for(int+i=1,j=0;i<27;)+++//+Loop+from+1+to+26+included
++System.out.printf("%25c",+//+Print+a+character
+++j%2B%2B<i++++++++++++++++++//+Do+we+need+to+print+a+letter+or+a+new+line?
++++?96%2Bi+++++++++++++++++//+It's+a+character,+construct+it.
++++:10%2B(j-=%2B%2Bi)++++++++++//+It's+a+new+line,+increment+i+and+reset+j+to+0.
++);
}|entityMap|0|LINK|mutability|MUTABLE|url|http://openjdk.java.net/|1|https://tio.run/##LY3BasMwEETv@YolUJBQLJIeWhLb6SHn0kOOpQdFkcIq8spYq0AI/nbXDT0NvBneBHMzVeodhfN16sspogUbTc7waZDgsQD4p5kNz3FLeIZu7sSRB6TL9w@Y4ZLlcwoQZp8ujFH7QpYxkT4kyqVzQ/N1Cs7yHnw7UbV/@DQIJAZsN6vQrmtsXt9rebxndp1OhXU/@9mL5YtdroJSDX5s3xTuNmslQtUqhVLW41Q/f7021rqeBZUY5R8bF@P0Cw^0|0|G|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|6|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="http://openjdk.java.net/" rel="nofollow noreferrer">Java (OpenJDK 8)</a>, 74 bytes</h1>



<pre class="lang-java prettyprint-override"><code>n-&gt;{for(int i=1,j=0;i&lt;27;)System.out.printf("%c",j++&lt;i?96+i:10+(j-=++i));}
</code></pre>

<p><a href="https://tio.run/##LY3BasMwEETv@YolUJBQLJIeWhLb6SHn0kOOpQdFkcIq8spYq0AI/nbXDT0NvBneBHMzVeodhfN16sspogUbTc7waZDgsQD4p5kNz3FLeIZu7sSRB6TL9w@Y4ZLlcwoQZp8ujFH7QpYxkT4kyqVzQ/N1Cs7yHnw7UbV/@DQIJAZsN6vQrmtsXt9rebxndp1OhXU/@9mL5YtdroJSDX5s3xTuNmslQtUqhVLW41Q/f7021rqeBZUY5R8bF@P0Cw" rel="nofollow noreferrer" title="Java (OpenJDK 8) – Try It Online">Try it online!</a></p>

<p>6 bytes saved thanks to @KevinCruijssen</p>

<h2>Explanations</h2>

<pre class="lang-java prettyprint-override"><code>n-&gt;{                      // Lambda, unused parameter
 for(int i=1,j=0;i&lt;27;)   // Loop from 1 to 26 included
  System.out.printf("%c", // Print a character
   j++&lt;i                  // Do we need to print a letter or a new line?
    ?96+i                 // It's a character, construct it.
    :10+(j-=++i)          // It's a new line, increment i and reset j to 0.
  );
}
</code></pre>


blocks|key|159142|text|R，38字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|159143|一个相对乏味的答案。将i从1迭代到26，打印字母表i倍的i第四个字母(带有一个隐式断线)。|unstyled|style|CODE|159144|for(i+in+1:26)print(rep(letters[i],i))|code-block|syntax|javascript|159145|在网上试试！|159146|更有趣的方法可能是使用如下内容：|159147|cat(letters[(1:351*2)%5E.5%2B.5])|159148|这给了我们正确数量的所有字母，但没有换行。也许比我聪明的人能想出一种方法，用它来做出高尔夫的答案。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.r-project.org/|1|https://tio.run/##K/r/Py2/SCNTITNPwdDKyEyzoCgzr0SjKLVAIye1pCS1qDg6M1YnU1Pz/38A^0|0|1|0|0|B|1|P|1|S|1|0|0|0|6|1|0|0|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|@$A|19|B|1A|G|H]|$A|1B|B|1C|G|H]|$A|1D|B|1E|G|H]]|9|@]|C|$]]|$1|I|3|J|5|K|7|1F|8|@]|9|@]|C|$L|M]]|$1|N|3|O|5|F|7|1G|8|@]|9|@$A|1H|B|1I|1|1J]]|C|$]]|$1|P|3|Q|5|F|7|1K|8|@]|9|@]|C|$]]|$1|R|3|S|5|K|7|1L|8|@]|9|@]|C|$L|M]]|$1|T|3|U|5|F|7|1M|8|@]|9|@]|C|$]]]|V|$W|$5|X|Y|Z|C|$10|11]]|12|$5|X|Y|Z|C|$10|13]]]]

<h1><a href="https://www.r-project.org/" rel="nofollow noreferrer">R</a>, 38 bytes</h1>



<p>A relatively uninteresting answer. Iterate for <code>i</code> from 1 to 26, print the <code>i</code>th letter of the alphabet <code>i</code> times (with an implicit line break).</p>

<pre class="lang-r prettyprint-override"><code>for(i in 1:26)print(rep(letters[i],i))
</code></pre>

<p><a href="https://tio.run/##K/r/Py2/SCNTITNPwdDKyEyzoCgzr0SjKLVAIye1pCS1qDg6M1YnU1Pz/38A" rel="nofollow noreferrer" title="R – Try It Online">Try it online!</a></p>

<p>A more interesting approach might be to use something like the following:</p>

<pre class="lang-r prettyprint-override"><code>cat(letters[(1:351*2)^.5+.5])
</code></pre>

<p>This gives us all the letters in the right amount, but no linebreaks. Perhaps someone smarter than me can figure out a way to use that to make a golfier answer.</p>


blocks|key|159956|text|生锈，82字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|159957|%7C%7Cfor+i+in+1..27u8{println!("{}",((i%2B96)+as+char).to_string().repeat(i+as+usize))}|code-block|syntax|javascript|159958|我本来希望它会短得多，但是在类型之间显式转换/转换需要很多字节：|unstyled|159959|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://www.rust-lang.org/|1|https://tio.run/##Lc3LCsIwEEbhfZ/it6sZlIAuvFB8Fgkl1YGYlkmyMc2zxwquz4FPc0xtCnhbCcQoHeBdwujnmNXhjrau06wQSMDRmNMlX8uiEpIPO@pL7Q9Esr@dGTZifFllk@ZHTNvyJDbqFmcTya/mKB/HXBswbM7fIB662r4^0|0|2|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|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@]|C|$]]|$1|L|3|M|5|K|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://www.rust-lang.org/" rel="nofollow noreferrer">Rust</a>, 82 bytes</h1>



<pre class="lang-rust prettyprint-override"><code>||for i in 1..27u8{println!("{}",((i+96) as char).to_string().repeat(i as usize))}
</code></pre>

<p>I had hoped that it would've been a lot shorter, but explicitly converting/casting between types takes a lot of bytes :(</p>

<p><a href="https://tio.run/##Lc3LCsIwEEbhfZ/it6sZlIAuvFB8Fgkl1YGYlkmyMc2zxwquz4FPc0xtCnhbCcQoHeBdwujnmNXhjrau06wQSMDRmNMlX8uiEpIPO@pL7Q9Esr@dGTZifFllk@ZHTNvyJDbqFmcTya/mKB/HXBswbM7fIB662r4" rel="nofollow noreferrer" title="Rust – Try It Online">Try it online!</a></p>


blocks|key|161399|text|脑Flak，107个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|161400|((((()()()){}){}()){}){(({})){({}<(({})<({}((((()()()()){}){}){}){})>)>[()])}{}({}<((()()()()()){})>[()])}|code-block|syntax|javascript|161401|在网上试试！|unstyled|161402|这是代码的106字节，-A标志的%2B1字节，它支持ASCII输出。|style|CODE|161403|解释：|161404|#Push+26
((((()()()){}){}()){})

#While+True...
{

++++#Duplicate+A
++++(({}))

++++#While+True...
++++{
++++++++#Grab+the+value+of+A...
++++++++({}<

++++++++++++#Make+a+duplicate+of+B+(on+the+first+loop,+B+==+A)
++++++++++++(({})<

++++++++++++++++#Push+B+%2B+
++++++++++++++++({}

++++++++++++++++#64+(ASCII+'A'+-+1)
++++++++++++++++((((()()()()){}){}){}){})

++++++++++++#Then+push+B+on+top+of+all+of+that
++++++++++++>)

++++++++#Push+A+-+1+on+top+of+all+of+that
++++++++>[()])

++++#Endwhile,+pop+the+loop+counter
++++}{}

++++#Underneath+A,
++++({}<

++++++++#Push+10
++++++++((()()()()()){})

++++#+Then+Push+A+-+1
++++>[()])

#Endwhile
}|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DJMcMayhem/Brain-Flak|1|https://tio.run/##SypKzMzTTctJzP7/XwMENEFQs7oWiKC0hgaQBFLVtTZgpg2QQCiFKYYiO027aA3NWM1aoBqwBpgqiDqo5P///3UdAQ^0|0|5|0|0|0|0|6|1|0|5|3|B|2|G|2|0|0^^$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|@$A|1C|B|1D|N|O]|$A|1E|B|1F|N|O]|$A|1G|B|1H|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1I|8|@]|9|@]|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]]]]

<h1><a href="https://github.com/DJMcMayhem/Brain-Flak" rel="nofollow noreferrer">Brain-Flak</a>, 107 bytes</h1>

<pre><code>((((()()()){}){}()){}){(({})){({}&lt;(({})&lt;({}((((()()()()){}){}){}){})&gt;)&gt;[()])}{}({}&lt;((()()()()()){})&gt;[()])}
</code></pre>

<p><a href="https://tio.run/##SypKzMzTTctJzP7/XwMENEFQs7oWiKC0hgaQBFLVtTZgpg2QQCiFKYYiO027aA3NWM1aoBqwBpgqiDqo5P///3UdAQ" rel="nofollow noreferrer" title="Brain-Flak – Try It Online">Try it online!</a></p>

<p>This is <code>106</code> bytes of code, and <code>+1</code> byte for the <code>-A</code> flag, which enables ASCII output.</p>

<p>Explanation:</p>

<pre><code>#Push 26
((((()()()){}){}()){})

#While True...
{

    #Duplicate A
    (({}))

    #While True...
    {
        #Grab the value of A...
        ({}&lt;

            #Make a duplicate of B (on the first loop, B == A)
            (({})&lt;

                #Push B + 
                ({}

                #64 (ASCII 'A' - 1)
                ((((()()()()){}){}){}){})

            #Then push B on top of all of that
            &gt;)

        #Push A - 1 on top of all of that
        &gt;[()])

    #Endwhile, pop the loop counter
    }{}

    #Underneath A,
    ({}&lt;

        #Push 10
        ((()()()()()){})

    # Then Push A - 1
    &gt;[()])

#Endwhile
}
</code></pre>


blocks|key|1295725|text|派克，5字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1295726|G+Foh*|code-block|syntax|javascript|1295727|在这里试试！|unstyled|1295728|+++++++-+o=0
G++++++-++alphabet
++F++++-+for+i+in+%5E:
+++++*+-++%5E+*+v
+++oh++-+++(o%2B%2B)%2B1|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/muddyfish/PYKE|1|https://pyke.catbus.co.uk/?code=47%2BB1%2B6F%2B68%2B2A&input=&warnings=1&hex=1^0|0|2|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|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://github.com/muddyfish/PYKE" rel="nofollow noreferrer">Pyke</a>, 5 bytes</h1>
<pre><code>G Foh*
</code></pre>
<p><a href="https://pyke.catbus.co.uk/?code=47+B1+6F+68+2A&amp;input=&amp;warnings=1&amp;hex=1" rel="nofollow noreferrer">Try it here!</a></p>
<pre><code>       - o=0
G      -  alphabet
  F    - for i in ^:
     * -  ^ * v
   oh  -   (o++)+1
</code></pre>


blocks|key|1295888|text|VBA，33+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|1295889|匿名VBE即时窗口函数，该函数输出到VBE即时窗口|unstyled|1295890|For+i=1To+26:?String(i,96%2Bi):Next|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>VBA, 33 Bytes</h1>

<p>Anonymous VBE immediate window function that outputs to the VBE immediate window</p>
<pre class="lang-vb prettyprint-override"><code>For i=1To 26:?String(i,96+i):Next
</code></pre>


blocks|key|1296244|text|C#+(.NET+Core)，78字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1296245|n=>{var+s="";for(int+i=1;i<27;)s%2B=new+string((char)(i%2B96),i%2B%2B)%2B'\n';return+s;}|code-block|syntax|javascript|1296246|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.microsoft.com/net/core/platform|1|https://tio.run/##Pc2xasMwEIDhOX6Kw0sk5Jo0Q0OQlaXQKYVAhw5NB6HI7oF9gjs5oQQ/u2to6f79/EEeQuI4h96LwIlTx36Ae7GS7DMGuCa8wKtHUpIZqfv4BM@d6IUUb9@S41C/jBQapFzBLzlAC24md7hfPYO4srRtYrUIQPdosdnurBbjKN7@CqXCl2et0OyfdIXGaLM@09pyzCMTiJ1m@797TiSpj/U7Y45HpKhatdF6AaupmOYf^0|0|E|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.microsoft.com/net/core/platform" rel="nofollow noreferrer">C# (.NET Core)</a>, 78 bytes</h1>



<pre class="lang-cs prettyprint-override"><code>n=&gt;{var s="";for(int i=1;i&lt;27;)s+=new string((char)(i+96),i++)+'\n';return s;}
</code></pre>

<p><a href="https://tio.run/##Pc2xasMwEIDhOX6Kw0sk5Jo0Q0OQlaXQKYVAhw5NB6HI7oF9gjs5oQQ/u2to6f79/EEeQuI4h96LwIlTx36Ae7GS7DMGuCa8wKtHUpIZqfv4BM@d6IUUb9@S41C/jBQapFzBLzlAC24md7hfPYO4srRtYrUIQPdosdnurBbjKN7@CqXCl2et0OyfdIXGaLM@09pyzCMTiJ1m@797TiSpj/U7Y45HpKhatdF6AaupmOYf" rel="nofollow noreferrer" title="C# (.NET Core) – Try It Online">Try it online!</a></p>


blocks|key|1296284|text|Mathematica，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1296285|Alphabet[][[#]]~Table~#&~Array~26|code-block|syntax|javascript|1296286|在网上试试！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##y00syUjNTSzJTE78n6Zgq/DfMacgIzEptSQ6NjpaOTa2LiQxKSe1TlmtzrGoKLGyzsjsf0BRZl6JQ9p/AA^0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Mathematica, 33 bytes</h1>
<pre><code>Alphabet[][[#]]~Table~#&amp;~Array~26
</code></pre>
<p><a href="https://tio.run/##y00syUjNTSzJTE78n6Zgq/DfMacgIzEptSQ6NjpaOTa2LiQxKSe1TlmtzrGoKLGyzsjsf0BRZl6JQ9p/AA" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>


blocks|key|158731|text|堆叠，14字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|158732|[26~>:96%2Bchr*]|code-block|syntax|javascript|158733|在网上试试！|unstyled|158734|将行列表推送到堆栈中。|158735|解释|158736|[26~>:96%2Bchr*]
[++++++++++++]++anonymous+function,+takes+no+arguments
+26~>+++++++++++range+from+1+to+26
+++++:96%2B+++++++push+range+from+97+to+122+(97..122')
+++++++++chr++++convert+each+of+these+to+a+char+('a'..'z')
++++++++++++*+++repeat+each+char+by+the+former+amount+('a'+'bb'+'ccc'+...)|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ConorOBrien-Foxx/stacked|1|https://tio.run/##Ky5JTM5OTfn/P9rIrM7OytJMOzmjSCv2v4@bQlZ@Zp5CfmnJfwA^0|0|2|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|6|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/ConorOBrien-Foxx/stacked" rel="nofollow noreferrer">Stacked</a>, 14 bytes</h1>

<pre><code>[26~&gt;:96+chr*]
</code></pre>

<p><a href="https://tio.run/##Ky5JTM5OTfn/P9rIrM7OytJMOzmjSCv2v4@bQlZ@Zp5CfmnJfwA" rel="nofollow noreferrer" title="Stacked – Try It Online">Try it online!</a></p>

<p>Pushes a list of lines to the stack.</p>

<h2>Explanation</h2>

<pre><code>[26~&gt;:96+chr*]
[            ]  anonymous function, takes no arguments
 26~&gt;           range from 1 to 26
     :96+       push range from 97 to 122 (97..122')
         chr    convert each of these to a char ('a'..'z')
            *   repeat each char by the former amount ('a' 'bb' 'ccc' ...)
</code></pre>


blocks|key|159043|text|C+(gcc)，53字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|159044|i,j;f(){i=i-putchar(j%2B%2B-i?96%2Bi:(j=!%2B%2Bi)%2B10)-16&&f();}|code-block|syntax|javascript|159045|打印一个领先的换行符。行为不明，但和gcc一起工作.|unstyled|159046|在网上试试！|offset|length|159047|C，54字节|159048|j;main(i){for(;i<27;)putchar(j%2B%2B-i?96%2Bi:(j=!%2B%2Bi)%2B10);}|159049|159050|159051|i,j;f(){putchar(j%2B%2B-i?96%2Bi:(j=!%2B%2Bi)%2B10);(i%25=27)&&f();}|159052|打印一个领先的换行符。|159053|159054|C，56字节|159055|main(i,j){for(;i<27;)for(j=%2B%2Bi;j--;)putchar(j?95%2Bi:10);}|159056|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##S9ZNT07@/z9TJ8s6TUOzOtM2U7egtCQ5I7FII0tbWzfT3tJMO9NKI8tWUVs7U1Pb0EBT19BMTQ2o1rr2f2ZeiUJuYmaehiZXNZcCEICEQZir9j8A|1|https://tio.run/##S9ZNT07@/z/LOjcxM08jU7M6Lb9IwzrTxsjcWrOgtCQ5I7FII0tbWzfT3tJMO9NKI8tWUVs7U1Pb0EDTuvb/fwA|2|https://tio.run/##S9ZNT07@/z9TJ8s6TUOzuqC0JDkjsUgjS1tbN9Pe0kw700ojy1ZRWztTU9vQQNNaI1PV1shcU00NqNi69n9mXolCbmJmnoYmVzWXAhCAhEGYq/Y/AA|3|https://tio.run/##S9ZNT07@/z83MTNPI1MnS7M6Lb9IwzrTxsjcWhPEzLLV1s60ztLVtdYsKC1JzkgECtlbmmpnWhkaaFrX/v8PAA^0|0|0|0|0|6|0|0|0|0|0|6|1|0|0|0|0|0|6|2|0|0|0|0|6|3^^$0|@$1|2|3|4|5|6|7|1G|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|1H|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|1I|8|@]|9|@]|A|$]]|$1|J|3|K|5|I|7|1J|8|@]|9|@$L|1K|M|1L|1|1M]]|A|$]]|$1|N|3|O|5|6|7|1N|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|1O|8|@]|9|@]|A|$E|F]]|$1|R|3|K|5|I|7|1P|8|@]|9|@$L|1Q|M|1R|1|1S]]|A|$]]|$1|S|3|O|5|6|7|1T|8|@]|9|@]|A|$]]|$1|T|3|U|5|D|7|1U|8|@]|9|@]|A|$E|F]]|$1|V|3|W|5|I|7|1V|8|@]|9|@]|A|$]]|$1|X|3|K|5|I|7|1W|8|@]|9|@$L|1X|M|1Y|1|1Z]]|A|$]]|$1|Y|3|Z|5|6|7|20|8|@]|9|@]|A|$]]|$1|10|3|11|5|D|7|21|8|@]|9|@]|A|$E|F]]|$1|12|3|K|5|I|7|22|8|@]|9|@$L|23|M|24|1|25]]|A|$]]]|13|$14|$5|15|16|17|A|$18|19]]|1A|$5|15|16|17|A|$18|1B]]|1C|$5|15|16|17|A|$18|1D]]|1E|$5|15|16|17|A|$18|1F]]]]

<h1>C (gcc), 53 bytes</h1>

<pre><code>i,j;f(){i=i-putchar(j++-i?96+i:(j=!++i)+10)-16&amp;&amp;f();}
</code></pre>

<p>Prints a leading newline. Has undefined behaviour, but works with gcc...</p>

<p><a href="https://tio.run/##S9ZNT07@/z9TJ8s6TUOzOtM2U7egtCQ5I7FII0tbWzfT3tJMO9NKI8tWUVs7U1Pb0EBT19BMTQ2o1rr2f2ZeiUJuYmaehiZXNZcCEICEQZir9j8A" rel="nofollow noreferrer">Try it online!</a></p>

<h1>C, 54 bytes</h1>

<pre><code>j;main(i){for(;i&lt;27;)putchar(j++-i?96+i:(j=!++i)+10);}
</code></pre>

<p><a href="https://tio.run/##S9ZNT07@/z/LOjcxM08jU7M6Lb9IwzrTxsjcWrOgtCQ5I7FII0tbWzfT3tJMO9NKI8tWUVs7U1Pb0EDTuvb/fwA" rel="nofollow noreferrer">Try it online!</a></p>

<h1>C, 54 bytes</h1>

<pre><code>i,j;f(){putchar(j++-i?96+i:(j=!++i)+10);(i%=27)&amp;&amp;f();}
</code></pre>

<p>Prints a leading newline.</p>

<p><a href="https://tio.run/##S9ZNT07@/z9TJ8s6TUOzuqC0JDkjsUgjS1tbN9Pe0kw700ojy1ZRWztTU9vQQNNaI1PV1shcU00NqNi69n9mXolCbmJmnoYmVzWXAhCAhEGYq/Y/AA" rel="nofollow noreferrer">Try it online!</a></p>

<h1>C, 56 bytes</h1>

<pre><code>main(i,j){for(;i&lt;27;)for(j=++i;j--;)putchar(j?95+i:10);}
</code></pre>

<p><a href="https://tio.run/##S9ZNT07@/z83MTNPI1MnS7M6Lb9IwzrTxsjcWhPEzLLV1s60ztLVtdYsKC1JzkgECtlbmmpnWhkaaFrX/v8PAA" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|159226|text|木炭，6字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|159227|Ｅβ×ι⊕κ|code-block|syntax|javascript|159228|在网上试试！链接是详细的代码版本。解释：|unstyled|159229|+++++κ++Index
++++⊕+++Incremented
+++ι++++Character
++×+++++Repeated
+β++++++Lowercase+letters
Ｅ+++++++Map+over+each+character
++++++++Implicitly+print+each+result+on+its+own+line|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/somebody1234/Charcoal|1|https://tio.run/##S85ILErOT8z5/z@gKDOvRMM3sUAjSUchJDM3tVgjU0fBMy@5KDU3Na8kNUUjWxMIrP///69blgMA^0|0|2|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|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://github.com/somebody1234/Charcoal" rel="nofollow noreferrer">Charcoal</a>, 6 bytes</h1>

<pre><code>Ｅβ×ι⊕κ
</code></pre>

<p><a href="https://tio.run/##S85ILErOT8z5/z@gKDOvRMM3sUAjSUchJDM3tVgjU0fBMy@5KDU3Na8kNUUjWxMIrP///69blgMA" rel="nofollow noreferrer" title="Charcoal – Try It Online">Try it online!</a> Link is to verbose version of code. Explanation:</p>

<pre><code>     κ  Index
    ⊕   Incremented
   ι    Character
  ×     Repeated
 β      Lowercase letters
Ｅ       Map over each character
        Implicitly print each result on its own line
</code></pre>


blocks|key|1297140|text|杰夫特，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1297141|;C£RiXpYÄ|code-block|syntax|javascript|1297142|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|https://tio.run/##y0osKPn/39r50OKgzIiCyMMt//8DAA^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/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 9 bytes</h1>

<pre><code>;C£RiXpYÄ
</code></pre>

<p><a href="https://tio.run/##y0osKPn/39r50OKgzIiCyMMt//8DAA" rel="nofollow noreferrer" title="Japt – Try It Online">Try it online!</a></p>


blocks|key|1297822|text|布氏对数，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1297823|Ại₁j₎ẉ⊥|code-block|syntax|javascript|1297824|在网上试试！|unstyled|1297825|解释|1297826|Ạ+++++++++The+alphabet+string+"abcdefghijklmnopqrstuvwxyz"
+i₁+++++++A+couple:+[a+letter+of+the+alphabet,+its+index+(1-indexed)+in+it]
+++j₎+++++Juxtapose+that+letter+as+many+times+as+its+index
+++++ẉ++++Write+followed+by+a+linebreak
++++++⊥+++False:+try+another+couple+of+[letter,+index]|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/JCumin/Brachylog|1|https://tio.run/##SypKTM6ozMlPN/r//@GuBZmPmhqzHjX1PdzV@ahr6f///wE^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://github.com/JCumin/Brachylog" rel="nofollow noreferrer">Brachylog</a>, 7 bytes</h1>
<pre><code>Ại₁j₎ẉ⊥
</code></pre>
<p><a href="https://tio.run/##SypKTM6ozMlPN/r//@GuBZmPmhqzHjX1PdzV@ahr6f///wE" rel="nofollow noreferrer" title="Brachylog – Try It Online">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>Ạ         The alphabet string &quot;abcdefghijklmnopqrstuvwxyz&quot;
 i₁       A couple: [a letter of the alphabet, its index (1-indexed) in it]
   j₎     Juxtapose that letter as many times as its index
     ẉ    Write followed by a linebreak
      ⊥   False: try another couple of [letter, index]
</code></pre>


blocks|key|160334|text|灵丹妙药，47字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|160335|for+x<-?a..?z,do:+IO.puts+List.duplicate+x,x-96|code-block|syntax|javascript|160336|试试看|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://elixir-lang.org/|1|https://tio.run/##S83JrMgs@v8/Lb9IocJG1z5RT8@@Sicl30rB01@voLSkWMEns7hEL6W0ICczObEkVaFCp0LX0uz/fwA^0|0|4|0|0|0|0|3|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]]]]

<h2><a href="https://elixir-lang.org/" rel="nofollow noreferrer">Elixir</a>, 47 bytes</h2>

<pre><code>for x&lt;-?a..?z,do: IO.puts List.duplicate x,x-96
</code></pre>

<p><a href="https://tio.run/##S83JrMgs@v8/Lb9IocJG1z5RT8@@Sicl30rB01@voLSkWMEns7hEL6W0ICczObEkVaFCp0LX0uz/fwA" rel="nofollow noreferrer">Try it</a></p>


blocks|key|160713|text|JavaScript，65字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|160714|for(x=0;x<26;)console.log(String.fromCharCode(x%2B97).repeat(%2B%2Bx));|code-block|syntax|javascript|160715|旧：|unstyled|160716|for(x=0;x<26;x%2B%2B)console.log((function+p(a,b){return+b==0?a:a%2Bp(a,--b);})(String.fromCharCode(97%2Bx),x));|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|$]]

<h1>JavaScript, 65 bytes</h1>

<pre><code>for(x=0;x&lt;26;)console.log(String.fromCharCode(x+97).repeat(++x));
</code></pre>

<p>old:</p>

<pre><code>for(x=0;x&lt;26;x++)console.log((function p(a,b){return b==0?a:a+p(a,--b);})(String.fromCharCode(97+x),x));
</code></pre>


blocks|key|1298653|text|通用Lisp，65字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1298654|(dotimes(a+26)(format+t"~v@{~a~:*~}~%25"(1%2B+a)(code-char(%2B+a+97))))|code-block|syntax|javascript|1298655|在网上试试！|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##S87JLC74/18jJb8kMze1WCNRwchMUyMtvyg3sUShRKmuzKG6LrHOSquutk5VScNQWyFRUyM5PyVVNzkjsUgDyFWwNNcEgv//AQ^0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Common Lisp, 65 bytes</h1>
<pre><code>(dotimes(a 26)(format t&quot;~v@{~a~:*~}~%&quot;(1+ a)(code-char(+ a 97))))
</code></pre>
<p><a href="https://tio.run/##S87JLC74/18jJb8kMze1WCNRwchMUyMtvyg3sUShRKmuzKG6LrHOSquutk5VScNQWyFRUyM5PyVVNzkjsUgDyFWwNNcEgv//AQ" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|160890|text|C#+(.NET+Core)，84字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|160891|()=>{return+A(1);string+A(int+n)=>new+string((char)(n%2B96),n)%2B(n<26?"\n"%2BA(%2B%2Bn):"");}|code-block|syntax|javascript|160892|在网上试试！|unstyled|160893|使用局部函数的递归方法(不允许输入)。|160894|UnGolfed|160895|()=>{
++++return+A(1);
++++string+A(int+n)+=>+new+string((char)(n%2B96),+n)+%2B
+++++++++++++++++++++++(n+<+26?+"\n"+%2B+A(%2B%2Bn)+:+"");
}|entityMap|0|LINK|mutability|MUTABLE|url|https://www.microsoft.com/net/core/platform|1|https://tio.run/##PY7BCsIwEETP5iuWnnaJCnoQNLYigicFoQcvXkIMGtAtZFNFSr@9ForehjcPZpxMXBV9V0vgG5QfSf5plHtYETg1SpJNwcG@ZreWFHungDLZEHdWPOTQIeVFE32qI8MWZ2QGq8@BE3Dfsn/DABHd3UZC1ssFjZk08nq@2GQXzvQWtWZaZRmZtjPqN/yqwhWONjCSatRoV7FUDz89x5D8IbDH/xkkMqpVbfcF^0|0|E|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|6|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://www.microsoft.com/net/core/platform" rel="nofollow noreferrer">C# (.NET Core)</a>, 84 bytes</h1>

<pre class="lang-cs prettyprint-override"><code>()=&gt;{return A(1);string A(int n)=&gt;new string((char)(n+96),n)+(n&lt;26?&quot;\n&quot;+A(++n):&quot;&quot;);}
</code></pre>
<p><a href="https://tio.run/##PY7BCsIwEETP5iuWnnaJCnoQNLYigicFoQcvXkIMGtAtZFNFSr@9ForehjcPZpxMXBV9V0vgG5QfSf5plHtYETg1SpJNwcG@ZreWFHungDLZEHdWPOTQIeVFE32qI8MWZ2QGq8@BE3Dfsn/DABHd3UZC1ssFjZk08nq@2GQXzvQWtWZaZRmZtjPqN/yqwhWONjCSatRoV7FUDz89x5D8IbDH/xkkMqpVbfcF" rel="nofollow noreferrer" title="C# (.NET Core) – Try It Online">Try it online!</a></p>
<p>A recursive approach using a local function (given no inputs were allowed).</p>
<h3>UnGolfed</h3>
<pre class="lang-cs prettyprint-override"><code>()=&gt;{
    return A(1);
    string A(int n) =&gt; new string((char)(n+96), n) +
                       (n &lt; 26? &quot;\n&quot; + A(++n) : &quot;&quot;);
}
</code></pre>


blocks|key|161042|text|C#+(.NET+Core)，57字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|161043|57字节，带有一行|161044|()=>new+int[27].Select((_,i)=>new+string((char)(i%2B96),i))|code-block|syntax|javascript|161045|59字节而不带行|161046|()=>new+int[26].Select((_,i)=>new+string((char)(i%2B%2B%2B97),i))|161047|在网上试试！|unstyled|161048|我正在使用using+System.Linq;|style|CODE|161049|int[x].Select()可以找到这里。|unordered-list-item|entityMap|0|LINK|mutability|MUTABLE|url|https://www.microsoft.com/net/core/platform|1|https://tio.run/##XY9BSwNBDIXv8ytyzLC6Bw@KbLuXRUVQEPbgQUTGNNrANIOT2YqU/vZ1ioriMbz38r1Hdkwp8zyZ6CuMH1Z407m/VzukGJmKJLX2ipWz0D/Hjehb5ygGM7jbOSuhCMHlpLS4vtBpwzk8R15YyTXU9zCWIHkIxrCEGf2yV34H0fJwcvrYjnygIT4dybfylUOkdcgepWma8zNfVT937ge2TbKC2yCK3u3cS50UaA24DRmkVqzff6noPQx1TYrc3ucq1/6MB5vv3N7t508|2|https://codegolf.stackexchange.com/a/70934/15214^0|0|E|0|0|0|0|0|0|0|6|1|0|5|I|0|0|F|J|2|2^^$0|@$1|2|3|4|5|6|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|D|3|E|5|6|7|1D|8|@]|9|@]|C|$]]|$1|F|3|G|5|H|7|1E|8|@]|9|@]|C|$I|J]]|$1|K|3|L|5|6|7|1F|8|@]|9|@]|C|$]]|$1|M|3|N|5|H|7|1G|8|@]|9|@]|C|$I|J]]|$1|O|3|P|5|Q|7|1H|8|@]|9|@$A|1I|B|1J|1|1K]]|C|$]]|$1|R|3|S|5|Q|7|1L|8|@$A|1M|B|1N|T|U]]|9|@]|C|$]]|$1|V|3|W|5|X|7|1O|8|@$A|1P|B|1Q|T|U]]|9|@$A|1R|B|1S|1|1T]]|C|$]]]|Y|$Z|$5|10|11|12|C|$13|14]]|15|$5|10|11|12|C|$13|16]]|17|$5|10|11|12|C|$13|18]]]]

<h1><a href="https://www.microsoft.com/net/core/platform" rel="nofollow noreferrer">C# (.NET Core)</a>, 57 bytes</h1>

<h2>57 bytes with a a trailling line</h2>



<pre class="lang-cs prettyprint-override"><code>()=&gt;new int[27].Select((_,i)=&gt;new string((char)(i+96),i))
</code></pre>

<h2>59 bytes without a trailling line</h2>



<pre class="lang-cs prettyprint-override"><code>()=&gt;new int[26].Select((_,i)=&gt;new string((char)(i+++97),i))
</code></pre>

<p><a href="https://tio.run/##XY9BSwNBDIXv8ytyzLC6Bw@KbLuXRUVQEPbgQUTGNNrANIOT2YqU/vZ1ioriMbz38r1Hdkwp8zyZ6CuMH1Z407m/VzukGJmKJLX2ipWz0D/Hjehb5ygGM7jbOSuhCMHlpLS4vtBpwzk8R15YyTXU9zCWIHkIxrCEGf2yV34H0fJwcvrYjnygIT4dybfylUOkdcgepWma8zNfVT937ge2TbKC2yCK3u3cS50UaA24DRmkVqzff6noPQx1TYrc3ucq1/6MB5vv3N7t508" rel="nofollow noreferrer" title="C# (.NET Core) – Try It Online">Try it online!</a></p>

<p>I am using <code>using System.Linq;</code></p>

<ul>
<li>The <code>int[x].Select()</code> can be found <a href="https://codegolf.stackexchange.com/a/70934/15214">here</a>.</li>
</ul>


blocks|key|161101|text|CJam，13字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|161102|26{)_96%2Bc*N}%25|code-block|syntax|javascript|161103|解释：|161104|26+++++++++++++e#+push+26
++{++++++++}%25++e#+for+n+in+0+..+25:
+++)+++++++++++e#+++increment
+++++96%2B+++++++e#+++add+96
++++++++c++++++e#+++convert+to+character
++++_++++*+++++e#+++repeat+that+character+n%2B1+times
++++++++++N++++e#+++add+a+newline|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|M|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|N|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|O|8|@]|9|@]|A|$E|F]]]|K|$]]

<h1>CJam, 13 bytes</h1>

<pre><code>26{)_96+c*N}%
</code></pre>

<h2>Explanation:</h2>

<pre><code>26             e# push 26
  {        }%  e# for n in 0 .. 25:
   )           e#   increment
     96+       e#   add 96
        c      e#   convert to character
    _    *     e#   repeat that character n+1 times
          N    e#   add a newline
</code></pre>


blocks|key|161218|text|欠负荷，62字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|161219|()(::(.)~%5E(.):*:*:*:*:*::***(+)*~%5ES(
)S(:)~*(*)*):*::*:*::***%5E|code-block|syntax|javascript|161220|在网上试试！|unstyled|161221|这实际上是在扩大允许的范围。|161222|它输出一个由字符串(OP允许)表示的行列表，其中字符串是字节列表(由元共识允许)，其中字节是一元表示的(也是元共识允许的)。|161223|结果是..。好吧，亲眼目睹。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/catseye/stringie|1|https://tio.run/##K81LSS3KyU9M@f9fQ1PDykpDT7MuDkhYacGhlZaWloaCplZdXLAGl2awhpVmnZaGlqaWJlgOqiDu/38A|2|https://codegolf.meta.stackexchange.com/a/2216/61384|3|https://codegolf.meta.stackexchange.com/a/5349/61384|4|https://pastebin.com/Wy7W9Z5P^0|0|3|0|0|0|0|6|1|0|0|Y|3|2|1I|3|3|0|9|4|4^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]|$1|D|3|E|5|F|7|1A|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|L|3|M|5|K|7|1F|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1G|8|@]|9|@$A|1H|B|1I|1|1J]|$A|1K|B|1L|1|1M]]|C|$]]|$1|P|3|Q|5|K|7|1N|8|@]|9|@$A|1O|B|1P|1|1Q]]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|T|U|V|C|$W|11]]|12|$5|T|U|V|C|$W|13]]|14|$5|T|U|V|C|$W|15]]]]

<h1><a href="https://github.com/catseye/stringie" rel="nofollow noreferrer">Underload</a>, 62 bytes</h1>

<pre><code>()(::(.)~^(.):*:*:*:*:*::***( )*~^S(
)S(:)~*(*)*):*::*:*::***^
</code></pre>

<p><a href="https://tio.run/##K81LSS3KyU9M@f9fQ1PDykpDT7MuDkhYacGhlZaWloaCplZdXLAGl2awhpVmnZaGlqaWJlgOqiDu/38A" rel="nofollow noreferrer" title="Underload – Try It Online">Try it online!</a></p>

<p>This is <em>really</em> stretching the limits of what's allowed.</p>

<p>It outputs a list of lines represented by strings (allowed by the OP), where the strings are lists of bytes (allowed by <a href="https://codegolf.meta.stackexchange.com/a/2216/61384">meta consensus</a>), where the bytes are given in unary (also allowed by <a href="https://codegolf.meta.stackexchange.com/a/5349/61384">meta consensus</a>).</p>

<p>The result is... well, <a href="https://pastebin.com/Wy7W9Z5P" rel="nofollow noreferrer">see for yourself</a>.</p>


blocks|key|161608|text|Kotlin，56字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|161609|for(c+in+'a'..'z'){for(j+in+0..c-'a')print(c);println()}|code-block|syntax|javascript|161610|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://kotlinlang.org/|1|https://tio.run/##y84vycnM@59WmqeQm5iZp5FYlF5s5VhUlFhpE1xSlJmXbqdZ/T8tv0gjWSEzT0E9UV1PT71KXbMaJJQFEjLQ00vWBYprFgBVl2gka1qDGTl5Gpq1/2v/AwA^0|0|6|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://kotlinlang.org" rel="nofollow noreferrer">Kotlin</a>, 56 bytes</h1>

<pre><code>for(c in 'a'..'z'){for(j in 0..c-'a')print(c);println()}
</code></pre>

<p><a href="https://tio.run/##y84vycnM@59WmqeQm5iZp5FYlF5s5VhUlFhpE1xSlJmXbqdZ/T8tv0gjWSEzT0E9UV1PT71KXbMaJJQFEjLQ00vWBYprFgBVl2gka1qDGTl5Gpq1/2v/AwA" rel="nofollow noreferrer" title="Kotlin – Try It Online">Try it online!</a></p>


blocks|key|161795|text|Kotlin，37字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|161796|{(1..26).map{"${'`'%2Bit}".repeat(it)}}|code-block|syntax|javascript|161797|在网上试试！|unstyled|161798|返回字符串列表。|entityMap|0|LINK|mutability|MUTABLE|url|https://kotlinlang.org/|1|https://tio.run/##y84vycnM@1@WmKOQZqWhqWvnk1lcYhNcUpSZl26nYPu/WsNQT8/ITFMvN7GgWkmlWj1BXTuzpFZJryi1IDWxRCOzRLO29n9aaZ5CbmJmnkZiUXqxlYJjUVFiJcwQzWouBYU0DbAJCtUFQLGSnDywPq7a/wA^0|0|6|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://kotlinlang.org" rel="nofollow noreferrer">Kotlin</a>, 37 bytes</h1>

<pre><code>{(1..26).map{"${'`'+it}".repeat(it)}}
</code></pre>

<p><a href="https://tio.run/##y84vycnM@1@WmKOQZqWhqWvnk1lcYhNcUpSZl26nYPu/WsNQT8/ITFMvN7GgWkmlWj1BXTuzpFZJryi1IDWxRCOzRLO29n9aaZ5CbmJmnkZiUXqxlYJjUVFiJcwQzWouBYU0DbAJCtUFQLGSnDywPq7a/wA" rel="nofollow noreferrer" title="Kotlin – Try It Online">Try it online!</a></p>

<p>Returns a List of Strings</p>


blocks|key|1300732|text|Java+(JDK)，68字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300733|n->{for(var+i='`';i%2B%2B<'z';)System.out.println((i%2B"").repeat(i-96));}|code-block|syntax|javascript|1300734|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://jdk.java.net/|1|https://tio.run/##RU@xboNADN3zFVYW7oQg6lKpoumeoVPGqFKdw1Anlzt0Z5DSiG@nhCbwFsv2s997J@wwO5XnwViMET6RHdxWKxix2YD5QVcTHi0BO6FQoaFpN3ewG@nwQOe5BKEooEYCcO18IF1M@/7/adMeLRuIgjKW6eBy11R7CezqwxdgqKN@enj4iCRtMw92EL1thb2D7Txc2LW3FZVgfEmDyz5ulQ@qwwC8Tb6TgtP0PflNCr2/RqFL7lvJm1FarFOK0/Va54EaQlGcvb1qXfRDsXh5Cuf3lCp7WcL1wx8^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="http://jdk.java.net/" rel="nofollow noreferrer">Java (JDK)</a>, 68 bytes</h1>

<pre class="lang-java prettyprint-override"><code>n-&gt;{for(var i='`';i++&lt;'z';)System.out.println((i+&quot;&quot;).repeat(i-96));}
</code></pre>
<p><a href="https://tio.run/##RU@xboNADN3zFVYW7oQg6lKpoumeoVPGqFKdw1Anlzt0Z5DSiG@nhCbwFsv2s997J@wwO5XnwViMET6RHdxWKxix2YD5QVcTHi0BO6FQoaFpN3ewG@nwQOe5BKEooEYCcO18IF1M@/7/adMeLRuIgjKW6eBy11R7CezqwxdgqKN@enj4iCRtMw92EL1thb2D7Txc2LW3FZVgfEmDyz5ulQ@qwwC8Tb6TgtP0PflNCr2/RqFL7lvJm1FarFOK0/Va54EaQlGcvb1qXfRDsXh5Cuf3lCp7WcL1wx8" rel="nofollow noreferrer" title="Java (JDK) – Try It Online">Try it online!</a></p>


blocks|key|1300933|text|维沙尔+j，6字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1300934|ka¨2›*|code-block|syntax|javascript|1300935|在网上试试！|unstyled|1300936|怎么做？|1300937|ka¨2›*
ka+++++#+Push+the+lowercase+alphabet
++¨2+++#+Map+with+indices+(pushes+letter+and+index)
++++›++#+Increment+the+index+to+make+it+one-indexed
+++++*+#+Repeat+the+letter+that+many+times|1300938|也有6个字节：|1300939|kaf:ż*|1300940|1300941|1300942|kaf:ż*
ka+++++#+Push+the+lowercase+alphabet
++f++++#+Convert+to+list+of+characters
+++:+++#+Duplicate+it
++++ż++#+Push+length+range+[0,+length)
+++++*+#+Repeat+each+letter+that+many+times|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://vyxal.pythonanywhere.com/#WyJqIiwiIiwia2HCqDLigLoqIiwiIiwiIl0=|2|https://vyxal.pythonanywhere.com/#WyJqIiwiIiwia2FmOsW8KiIsIiIsIiJd^0|4|1|0|3|0|0|0|0|6|1|0|0|0|0|0|0|6|2|0|0^^$0|@$1|2|3|4|5|6|7|1A|8|@$9|1B|A|1C|B|C]]|D|@$9|1D|A|1E|1|1F]]|E|$]]|$1|F|3|G|5|H|7|1G|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|1H|8|@]|D|@$9|1I|A|1J|1|1K]]|E|$]]|$1|N|3|O|5|6|7|1L|8|@]|D|@]|E|$]]|$1|P|3|Q|5|H|7|1M|8|@]|D|@]|E|$I|J]]|$1|R|3|S|5|M|7|1N|8|@]|D|@]|E|$]]|$1|T|3|U|5|H|7|1O|8|@]|D|@]|E|$I|J]]|$1|V|3|L|5|M|7|1P|8|@]|D|@$9|1Q|A|1R|1|1S]]|E|$]]|$1|W|3|O|5|6|7|1T|8|@]|D|@]|E|$]]|$1|X|3|Y|5|H|7|1U|8|@]|D|@]|E|$I|J]]]|Z|$10|$5|11|12|13|E|$14|15]]|16|$5|11|12|13|E|$14|17]]|18|$5|11|12|13|E|$14|19]]]]

<h1><a href="https://github.com/Vyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a> <code>j</code>, 6 bytes</h1>
<pre><code>ka¨2›*
</code></pre>
<p><a href="https://vyxal.pythonanywhere.com/#WyJqIiwiIiwia2HCqDLigLoqIiwiIiwiIl0=" rel="nofollow noreferrer">Try it Online!</a></p>
<h2>How?</h2>
<pre><code>ka¨2›*
ka     # Push the lowercase alphabet
  ¨2   # Map with indices (pushes letter and index)
    ›  # Increment the index to make it one-indexed
     * # Repeat the letter that many times
</code></pre>
<p>Also 6 bytes:</p>
<pre><code>kaf:ż*
</code></pre>
<p><a href="https://vyxal.pythonanywhere.com/#WyJqIiwiIiwia2FmOsW8KiIsIiIsIiJd" rel="nofollow noreferrer">Try it Online!</a></p>
<h2>How?</h2>
<pre><code>kaf:ż*
ka     # Push the lowercase alphabet
  f    # Convert to list of characters
   :   # Duplicate it
    ż  # Push length range [0, length)
     * # Repeat each letter that many times
</code></pre>


blocks|key|1295616|text|皮斯，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1295617|.e*hkbG|code-block|syntax|javascript|1295618|在网上试试！|unstyled|1295619|输出一行列表。如果这是不允许的，添加一个j到开始，并让我知道添加一个字节的计数！|style|CODE|1295620|.e*hkbG++Full+program+-+outputs+to+stdout
.e+++++++map+over
++++++G++the+alphabet,
++*++b+++repeating+each+letter
+++hk++++according+to+its+index%2B1|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/isaacg1/pyth|1|https://tio.run/##K6gsyfj/Xy9VKyM7yf3/fwA^0|0|2|0|0|0|0|6|1|0|K|1|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|@$A|1A|B|1B|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1C|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/isaacg1/pyth" rel="nofollow noreferrer">Pyth</a>, 7 bytes</h1>

<pre><code>.e*hkbG
</code></pre>

<p><a href="https://tio.run/##K6gsyfj/Xy9VKyM7yf3/fwA" rel="nofollow noreferrer" title="Pyth – Try It Online">Try it online!</a></p>

<p>Outputs a list of lines. If that's not allowed, add a <code>j</code> to the start and let me know to add one byte to the count!</p>

<hr>

<pre><code>.e*hkbG  Full program - outputs to stdout
.e       map over
      G  the alphabet,
  *  b   repeating each letter
   hk    according to its index+1
</code></pre>


blocks|key|1296386|text|JavaScript，113个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1296387|(function(){var+i=0,j=0,s;while(%2B%2Bi<=26){s="";j=0;while(%2B%2Bj<=i)s%2B=String.fromCharCode(96%2Bi);console.log(s);}})();|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>JavaScript, 113 bytes</h1>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>(function(){var i=0,j=0,s;while(++i&lt;=26){s="";j=0;while(++j&lt;=i)s+=String.fromCharCode(96+i);console.log(s);}})();</code></pre>
</div>
</div>
</p>


blocks|key|158833|text|Tcl，80字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|158834|set+a+97;time+{time+{puts+-nonewline+[format+%25c+$a]}+[incr+i];puts+"";incr+a}+26|code-block|syntax|javascript|158835|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://tcl.tk/|1|https://tio.run/##K0nO@f@/OLVEIVHB0ty6JDM3VaEaQhaUlhQr6Obl56WW52TmpSpEp@UX5SaWKKgmK6gkxtYqRGfmJRcpZMZagxUqKVmD@Ym1CkZm//8DAA^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="http://tcl.tk/" rel="nofollow noreferrer">Tcl</a>, 80 bytes</h1>

<pre><code>set a 97;time {time {puts -nonewline [format %c $a]} [incr i];puts "";incr a} 26
</code></pre>

<p><a href="https://tio.run/##K0nO@f@/OLVEIVHB0ty6JDM3VaEaQhaUlhQr6Obl56WW52TmpSpEp@UX5SaWKKgmK6gkxtYqRGfmJRcpZMZagxUqKVmD@Ym1CkZm//8DAA" rel="nofollow noreferrer" title="Tcl – Try It Online">Try it online!</a></p>


blocks|key|1297059|text|怪诞，42字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1297060|fori=1i<27i%2B%2Bprint("a".char(96%2Bi)::rep(i))|code-block|syntax|javascript|1297061|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/TehFlaminTaco/Funky|1|https://tio.run/##SyvNy678/z8tvyjT1jDTxsg8U1u7oCgzr0RDKVFJLzkjsUjD0kw7U9PKqii1QCNTU/P/fwA^0|0|2|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/TehFlaminTaco/Funky" rel="nofollow noreferrer">Funky</a>, 42 bytes</h1>

<pre><code>fori=1i&lt;27i++print("a".char(96+i)::rep(i))
</code></pre>

<p><a href="https://tio.run/##SyvNy678/z8tvyjT1jDTxsg8U1u7oCgzr0RDKVFJLzkjsUjD0kw7U9PKqii1QCNTU/P/fwA" rel="nofollow noreferrer" title="Funky – Try It Online">Try it online!</a></p>


blocks|key|159765|text|C%2B%2B，56字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|159766|for(char+a='a';a<='z';%2B%2Ba)cout<<string(a-'a'%2B1,a)<<endl;|code-block|syntax|javascript|159767|在网上试试|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##DcyxDsIgFAXQvV9B4gAEOzhD/ZebB0US@kqALhp/XWQ@yaFSVsrgOG6JKV8@CJfO1mvA8VyuljgKxhFaAQXRurfLkriLA4mVFp@xn1XRC1Vgk5AWbpNvaY2BpvPqzs1qHgrrVPO4QzsX2Gc7vuNHe0ZsY/wB^0|0|0|0|5|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|S|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|T|8|@]|9|@$I|U|J|V|1|W]]|A|$]]]|K|$L|$5|M|N|O|A|$P|Q]]]]

<h1>C++, 56 bytes</h1>

<pre><code>for(char a='a';a&lt;='z';++a)cout&lt;&lt;string(a-'a'+1,a)&lt;&lt;endl;
</code></pre>

<h1><a href="https://tio.run/##DcyxDsIgFAXQvV9B4gAEOzhD/ZebB0US@kqALhp/XWQ@yaFSVsrgOG6JKV8@CJfO1mvA8VyuljgKxhFaAQXRurfLkriLA4mVFp@xn1XRC1Vgk5AWbpNvaY2BpvPqzs1qHgrrVPO4QzsX2Gc7vuNHe0ZsY/wB" rel="nofollow noreferrer">Try it online</a></h1>


blocks|key|1298402|text|T，68字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1298403|使用变量和循环：|unstyled|1298404|DECLARE+@+INT=1;a:PRINT+REPLICATE(CHAR(@%2B96),@)SET+@%2B=1IF+@<27GOTO+a|code-block|syntax|javascript|1298405|更长(94个字节)，但感觉更像SQL，使用递归CTE生成数字表：|1298406|WITH+t+AS(SELECT+1n+UNION+ALL+SELECT+n%2B1FROM+t+WHERE+n<26)
SELECT+REPLICATE(CHAR(n%2B96),n)FROM+t|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|Q|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|G|7|S|8|@]|9|@]|A|$H|I]]]|N|$]]

<h1>T-SQL, 68 bytes</h1>
<p>Using a variable and loop:</p>
<pre class="lang-sql prettyprint-override"><code>DECLARE @ INT=1;a:PRINT REPLICATE(CHAR(@+96),@)SET @+=1IF @&lt;27GOTO a
</code></pre>
<p>Longer (<strong>94 bytes</strong>), but feels much more SQL-like, using a recursive CTE to generate a number table:</p>
<pre class="lang-sql prettyprint-override"><code>WITH t AS(SELECT 1n UNION ALL SELECT n+1FROM t WHERE n&lt;26)
SELECT REPLICATE(CHAR(n+96),n)FROM t
</code></pre>


blocks|key|1299163|text|检查，26字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1299164|+>#v
#d##)::>96%2B]*o<:>26-?|code-block|syntax|javascript|1299165|在网上试试！|unstyled|1299166|解释：|1299167|Check的花招是它可以在2D语义(用于控制流)和一维语义(用于堆栈操作)之间切换。该程序从程序的开头以一维语义开始。|1299168|>将0推入堆栈。#切换到2D语义，v向下引导IP。然后点击#，切换回主循环的一维语义。|style|CODE|1299169|#d##)::>96%2B]*o<:>26-?|1299170|?之前的命令如下所示：|1299171|#++++1D+mode:+++++++++++++++++++0
)++++increment:+++++++++++++++++1
:++++duplicate:+++++++++++++++++1,+1
:++++duplicate:+++++++++++++++++1,+1,+1
>96++push+96:+++++++++++++++++++1,+1,+1,+96
%2B++++add:+++++++++++++++++++++++1,+1,+97
]++++wrap:++++++++++++++++++++++1,+1,+[97]
*++++repeat:++++++++++++++++++++1,+[97]
o++++output+char+codes+("a"):+++1
<++++output+newline+("\n"):+++++1
:++++duplicate:+++++++++++++++++1,+1
>26++push+26:+++++++++++++++++++1,+1,+26
-++++subtract:++++++++++++++++++1,+-25|1299172|?是Check的唯一分支操作符。如果TOS为非零，则切换到2D语义，否则保持一维语义。在这种情况下，如果顶部堆栈值为0，则程序结束，如果为负值，则转到开头。#切换回一维语义，d删除顶级堆栈元素(因为?不会弹出它)。##切换到2D，然后再返回，然后循环重新启动。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ScratchMan544/check-lang|1|https://tio.run/##S85ITc7@/1/BTrmMSzlFWVnTysrO0kw7VivfxsrOyEzX/v9/AA^0|0|2|0|0|0|0|6|1|0|0|0|0|1|8|1|H|1|T|1|0|0|0|1|0|0|0|1|26|1|2F|1|2R|1|2Z|2^^$0|@$1|2|3|4|5|6|7|1A|8|@]|9|@$A|1B|B|1C|1|1D]]|C|$]]|$1|D|3|E|5|F|7|1E|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1F|8|@]|9|@$A|1G|B|1H|1|1I]]|C|$]]|$1|L|3|M|5|6|7|1J|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1K|8|@]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1L|8|@$A|1M|B|1N|R|S]|$A|1O|B|1P|R|S]|$A|1Q|B|1R|R|S]|$A|1S|B|1T|R|S]]|9|@]|C|$]]|$1|T|3|U|5|F|7|1U|8|@]|9|@]|C|$G|H]]|$1|V|3|W|5|K|7|1V|8|@$A|1W|B|1X|R|S]]|9|@]|C|$]]|$1|X|3|Y|5|F|7|1Y|8|@]|9|@]|C|$G|H]]|$1|Z|3|10|5|K|7|1Z|8|@$A|20|B|21|R|S]|$A|22|B|23|R|S]|$A|24|B|25|R|S]|$A|26|B|27|R|S]|$A|28|B|29|R|S]]|9|@]|C|$]]]|11|$12|$5|13|14|15|C|$16|17]]|18|$5|13|14|15|C|$16|19]]]]

<h1><a href="https://github.com/ScratchMan544/check-lang" rel="nofollow noreferrer">Check</a>, 26 bytes</h1>

<pre><code> &gt;#v
#d##)::&gt;96+]*o&lt;:&gt;26-?
</code></pre>

<p><a href="https://tio.run/##S85ITc7@/1/BTrmMSzlFWVnTysrO0kw7VivfxsrOyEzX/v9/AA" rel="nofollow noreferrer" title="Check – Try It Online">Try it online!</a></p>

<h2>Explanation:</h2>

<p>Check's gimmick is that it can switch between 2D semantics (for control flow) and 1D semantics (for stack manipulation). The program starts out at the beginning of the program in 1D semantics.</p>

<p><code>&gt;</code> pushes 0 to the stack. <code>#</code> switches to 2D semantics and <code>v</code> directs the IP downwards. It then hits <code>#</code>, switching back to 1D semantics for the main loop.</p>

<pre><code>#d##)::&gt;96+]*o&lt;:&gt;26-?
</code></pre>

<p>The commands before the <code>?</code> go like this:</p>

<pre><code>#    1D mode:                   0
)    increment:                 1
:    duplicate:                 1, 1
:    duplicate:                 1, 1, 1
&gt;96  push 96:                   1, 1, 1, 96
+    add:                       1, 1, 97
]    wrap:                      1, 1, [97]
*    repeat:                    1, [97]
o    output char codes ("a"):   1
&lt;    output newline ("\n"):     1
:    duplicate:                 1, 1
&gt;26  push 26:                   1, 1, 26
-    subtract:                  1, -25
</code></pre>

<p>The <code>?</code> is Check's only branching operator. It switches to 2D semantics if the TOS is nonzero, and stays in 1D semantics otherwise. In this case, if the top stack value is 0, then the program ends, and if it is negative, then it goes around to the beginning. <code>#</code> switches back to 1D semantics, <code>d</code> deletes the top stack element (since <code>?</code> does not pop it). <code>##</code> switches to 2D and then back again, and then the loop restarts.</p>


blocks|key|161539|text|Vim，33击键|type|header-two|depth|inlineStyleRanges|entityRanges|data|161540|:h<_␍jjYZZiyl0pr␛pqq{<C-a>YG@"q25@q{D|code-block|syntax|javascript|161541|解释|161542|:h<_␍jjYZZ+++++++++++++++++++++++++++++"+get+a-z+
++++++++++iyl0pr+++++++++++++++++++++++"+Put+yl0pr+as+macro+line+
++++++++++++++++␛p+++++++++++++++++++++"+Back+to+normal+mode+and+paste
++++++++++++++++++qq+++++++++++++++++++"+Record+macro
++++++++++++++++++++{++++++++++++++++++"+Go+to+macro+line+
+++++++++++++++++++++<C-a>+++++++++++++"+Increment+counter
++++++++++++++++++++++++++Y++++++++++++"+Yank+the+macro
+++++++++++++++++++++++++++G+++++++++++"+Go+to+last+line
++++++++++++++++++++++++++++@"+++++++++"+Run+the+macro+(also+adds+\r)
++++++++++++++++++++++++++++++q++++++++"+Stop+recording+@q
+++++++++++++++++++++++++++++++25@q++++"+Run+@q+25+times
+++++++++++++++++++++++++++++++++++{D++"+go+to+top+and+clear+the+line|161543|对此进行了实验，启发了上述宏观路线：|unstyled|161544|:h<_␍jjYZZP:exe+":norm+yl".line('.')."ps%5EM"␍25@:|161545|考虑将a-z放在不同的行上，全局替换为重复，但不能使:%25s/./\=repeat(\0,line('.'))/g工作--这很长。|offset|length|style|CODE|entityMap^0|0|0|0|0|0|0|3|3|Q|U^^$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|6|7|Y|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|K|3|L|5|M|7|10|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|11|8|@]|9|@]|A|$E|F]]|$1|P|3|Q|5|M|7|12|8|@$R|13|S|14|T|U]|$R|15|S|16|T|U]]|9|@]|A|$]]]|V|$]]

<h1>Vim, 33 Keystrokes</h1>

<pre><code>:h&lt;_␍jjYZZiyl0pr␛pqq{&lt;C-a&gt;YG@"q25@q{D
</code></pre>

<h2>Explanation</h2>

<pre><code>:h&lt;_␍jjYZZ                             " get a-z 
          iyl0pr                       " Put yl0pr as macro line 
                ␛p                     " Back to normal mode and paste
                  qq                   " Record macro
                    {                  " Go to macro line 
                     &lt;C-a&gt;             " Increment counter
                          Y            " Yank the macro
                           G           " Go to last line
                            @"         " Run the macro (also adds \r)
                              q        " Stop recording @q
                               25@q    " Run @q 25 times
                                   {D  " go to top and clear the line
</code></pre>

<p>Had experimented with this which inspired the above Macro line:</p>

<pre><code>:h&lt;_␍jjYZZP:exe ":norm yl".line('.')."ps^M"␍25@:
</code></pre>

<p>Thought about putting <code>a-z</code> on separate lines and global replace with repeat, but can't make <code>:%s/./\=repeat(\0,line('.'))/g</code> work -- and that's long.</p>


blocks|key|1299899|text|SNOBOL4+(CSNOBOL4)，74字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1299900|O	&LCASE+POS(I)+LEN(1)+.+X
	I+=I+%2B+1
	OUTPUT+=LE(I,26)+DUPL(X,I)+:S(O)
END|code-block|syntax|javascript|1299901|在网上试试！|unstyled|1299902|O	&LCASE+POS(I)+LEN(1)+.+X		;*+set+X+to+I'th+0-indexed+character+of+lowercase+letters
	I+=I+%2B+1				;*+increment+I
	OUTPUT+=LE(I,26)+DUPL(X,I)+:S(O)	;*+if+I<=26,+output+X+DUPLicated+I+times+and+goto+O+otherwise+goto+END
END|entityMap|0|LINK|mutability|MUTABLE|url|http://www.snobol4.org/csnobol4/|1|https://tio.run/##K87LT8rPMfn/359TzcfZMdhVIcA/WMNTU8HH1U/DUFNBTyGCi9NTwdZTQVvBkIvTPzQkIDREwdbHVcNTx8hMU8ElNMBHI0IHqMEqWMNfk8vVz@X/fwA^0|0|I|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|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

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

<pre><code>O&#9;&amp;LCASE POS(I) LEN(1) . X
&#9;I =I + 1
&#9;OUTPUT =LE(I,26) DUPL(X,I) :S(O)
END
</code></pre>

<p><a href="https://tio.run/##K87LT8rPMfn/359TzcfZMdhVIcA/WMNTU8HH1U/DUFNBTyGCi9NTwdZTQVvBkIvTPzQkIDREwdbHVcNTx8hMU8ElNMBHI0IHqMEqWMNfk8vVz@X/fwA" rel="nofollow noreferrer" title="SNOBOL4 (CSNOBOL4) – Try It Online">Try it online!</a></p>

<pre><code>O&#9;&amp;LCASE POS(I) LEN(1) . X&#9;&#9;;* set X to I'th 0-indexed character of lowercase letters
&#9;I =I + 1&#9;&#9;&#9;&#9;;* increment I
&#9;OUTPUT =LE(I,26) DUPL(X,I) :S(O)&#9;;* if I&lt;=26, output X DUPLicated I times and goto O otherwise goto END
END
</code></pre>


blocks|key|162386|text|R，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162387|cat(strrep(letters,1:26),sep="
")|code-block|syntax|javascript|162388|在网上试试！|unstyled|162389|这个挑战被撞上了main；我尝试了一种strrep方法，它比其他现有的R答案要短得多。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://www.r-project.org/|1|https://tio.run/##K/r/PzmxRKO4pKgotUAjJ7WkJLWoWMfQyshMU6c4tcBWiUtJ8/9/AA^0|0|1|0|0|0|0|6|1|0|J|6^^$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]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://www.r-project.org/" rel="nofollow noreferrer">R</a>, 33 bytes</h1>



<pre class="lang-r prettyprint-override"><code>cat(strrep(letters,1:26),sep="
")
</code></pre>

<p><a href="https://tio.run/##K/r/PzmxRKO4pKgotUAjJ7WkJLWoWMfQyshMU6c4tcBWiUtJ8/9/AA" rel="nofollow noreferrer" title="R – Try It Online">Try it online!</a></p>

<p>This challenge got bumped to main; I tried a <code>strrep</code> approach which was happily shorter than the other existing R answer.</p>


blocks|key|1300557|text|Scala+(39个字节)|type|header-two|depth|inlineStyleRanges|entityRanges|data|1300558|('a'to'z')map(n=>println(s"$n"*(n-96)))|code-block|syntax|javascript|1300559|在网上试试|unstyled|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##K05OzEn8n5@UlZpcouCbmJmnkFpRkpqXUqzgWFCgUP1fQz1RvSRfvUpdMzexQCPP1q6gKDOvJCdPo1hJJU9JSyNP19JMU1Pzf@1/AA^0|0|0|0|5|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|U|8|@]|9|@$J|V|K|W|1|X]]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

<h1>Scala (39 bytes)</h1>

<pre><code>('a'to'z')map(n=&gt;println(s"$n"*(n-96)))
</code></pre>

<p><a href="https://tio.run/##K05OzEn8n5@UlZpcouCbmJmnkFpRkpqXUqzgWFCgUP1fQz1RvSRfvUpdMzexQCPP1q6gKDOvJCdPo1hJJU9JSyNP19JMU1Pzf@1/AA" rel="nofollow noreferrer">Try it online</a></p>


blocks|key|1300623|text|前头，28字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300624|特色跟踪新线！|unstyled|1300625|'a'zEr~@~kdW<
~:\N\0<~'a-k:l|code-block|syntax|javascript|1300626|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ajc2/ahead|1|https://tio.run/##S8xITUz5/189Ub3KtajOoS47JdyGq84qxi/GwKZOPVE32yrn/38A^0|0|2|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://github.com/ajc2/ahead" rel="nofollow noreferrer">Ahead</a>, 28 bytes</h1>

<p>Featuring trailing newline! </p>

<pre><code>'a'zEr~@~kdW&lt;
~:\N\0&lt;~'a-k:l
</code></pre>

<p><a href="https://tio.run/##S8xITUz5/189Ub3KtajOoS47JdyGq84qxi/GwKZOPVE32yrn/38A" rel="nofollow noreferrer" title="Ahead – Try It Online">Try it online!</a></p>


blocks|key|162528|text|迷宫，25字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162529|\#"_2@
;++-6
("##
.+_
%2B59|code-block|syntax|javascript|162530|在网上试试！|unstyled|162531|有一个前导和一个尾随换行线的打印。|162532|++++++Start+at+the+top+left,+going+East
\+++++Print+a+newline
#"++++Push+stack+height+("+is+no-op)
_26-++Subtract+26;+if+negative,+turn+left+(South);+if+zero,+turn+backwards+(East)
62@+++Zero+case+(after+26+loops):+halt+after+a+few+dummy+instructions
##++++Negative+case+(after+n+loops):+push+stack+height+twice
++++++(n+--+inner+loop+counter+k,+then+n%2B1)
_95%2B++Add+95
.+++++Print+as+char
(+++++Decrement+k;+if+positive,+turn+right+(East);+if+zero,+go+straight+(North)
"#_+++Positive+case:+repeat+inner+loop
;+++++Zero+case:+remove+k+and+repeat+outer+loop|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/m-ender/labyrinth|1|https://tio.run/##y0lMqizKzCvJ@P8/Rlkp3siBy1pBQdeMS0NJWZlLTyGeS9vU8v9/AA^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|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/m-ender/labyrinth" rel="nofollow noreferrer">Labyrinth</a>, 25 bytes</h1>
<pre><code>\#&quot;_2@
;  -6
(&quot;##
. _
+59
</code></pre>
<p><a href="https://tio.run/##y0lMqizKzCvJ@P8/Rlkp3siBy1pBQdeMS0NJWZlLTyGeS9vU8v9/AA" rel="nofollow noreferrer" title="Labyrinth – Try It Online">Try it online!</a></p>
<p>Prints with one leading and one trailing newline.</p>
<pre><code>      Start at the top left, going East
\     Print a newline
#&quot;    Push stack height (&quot; is no-op)
_26-  Subtract 26; if negative, turn left (South); if zero, turn backwards (East)
62@   Zero case (after 26 loops): halt after a few dummy instructions
##    Negative case (after n loops): push stack height twice
      (n -- inner loop counter k, then n+1)
_95+  Add 95
.     Print as char
(     Decrement k; if positive, turn right (East); if zero, go straight (North)
&quot;#_   Positive case: repeat inner loop
;     Zero case: remove k and repeat outer loop
</code></pre>


blocks|key|162862|text|APOL，14字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|162863|ⅎ(ⓛ+p(*(∋+∈)))|unstyled|offset|length|style|CODE|162864|解释：|162865|ⅎ(++++++++1-indexed+for+(f+is+0-indexed)
++ⓛ++++++The+built-in+lowercase+ascii+letters+constant
++p(++++++Print
++++*(++++Multiply
++++++∋+++Current+item+in+the+for+loop
++++++∈+++For+loop+counter
++++)
++)
)|code-block|syntax|javascript|entityMap^0|0|0|E|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@$E|S|F|T|G|H]]|9|@]|A|$]]|$1|I|3|J|5|6|7|U|8|@]|9|@]|A|$]]|$1|K|3|L|5|M|7|V|8|@]|9|@]|A|$N|O]]]|P|$]]

<h1>APOL, 14 bytes</h1>
<p><code>ⅎ(ⓛ p(*(∋ ∈)))</code></p>
<h2>Explanation:</h2>
<pre><code>ⅎ(        1-indexed for (f is 0-indexed)
  ⓛ      The built-in lowercase ascii letters constant
  p(      Print
    *(    Multiply
      ∋   Current item in the for loop
      ∈   For loop counter
    )
  )
)
</code></pre>


blocks|key|1300827|text|金字塔方案，965字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300828|++++%5E
+++/+\
++/do+\
+%5E-----%5E
/!\++++-%5E
---%5E++++-%5E
++/=\++++-%5E
+%5E---%5E++++-%5E
/a\+/+\++++-%5E
---/26+\+++/[\
+++-----++%5E---%5E
+++++++++%5E-++/[\
++++++++%5E-++%5E---%5E
+++++++%5E-++/+\++-%5E
++++++%5E-++/set\++-%5E
+++++%5E-++%5E-----%5E++-%5E
++++/+\+/b\+++/a\++-%5E
+++/set\---+++---++/[\
++%5E-----%5E+++++++++%5E---%5E
+/a\+++/%2B\+++++++/+\++-%5E
+---++%5E---%5E+++++/do+\++-%5E
+++++/a\+/1\+++%5E-----%5E++-%5E
+++++---+---++/b\+++/[\++-%5E
++++++++++++++---++%5E---%5E++-%5E
++++++++++++++++++/+\++-%5E++-%5E
+++++++++++++++++/set\++-%5E++-%5E
++++++++++++++++%5E-----%5E++-%5E++-%5E
+++++++++++++++/b\+++/-\++-%5E++-%5E
+++++++++++++++---++%5E---%5E++-%5E++-%5E
+++++++++++++++++++/b\+/1\+/+\++-%5E
+++++++++++++++++++---+---/out\+/+\
+++++++++++++++++++++++++%5E-----/out\+
++++++++++++++++++++++++/+\+++%5E-----
+++++++++++++++++++++++/chr\+/+\
++++++++++++++++++++++%5E-----/chr\
+++++++++++++++++++++/%2B\++++-----%5E
++++++++++++++++++++%5E---%5E+++++++/+\
+++++++++++++++++++/a\+/+\+++++/10+\
+++++++++++++++++++---/96+\++++-----
++++++++++++++++++++++-----|code-block|syntax|javascript|1300829|在网上试试！|unstyled|1300830|哇这东西真大。嵌套循环的结果是一个非常大的程序。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ConorOBrien-Foxx/Pyramid-Scheme|1|https://tio.run/##fVM7DoMwDN05RTpXyG0HpA49SaNI/CQ6ICqgQ09P408@iKQeQmI/P78Y5/2d6/HVlUs79GO/bcqaKewCStsPdBN@TYlmCjhpBNgdHmVrUQ/nJqQLQK2RJmTAraIjPJFbEaniFDyzmdID/HkHIQDyeBd5ln6NfC6L1IgTk6AhAbWHUh7pULRyaZ/qa5IAylNw1uL2MsJF2I9tC2KoEVetjpIokes20pnoXs5i9kMw0pGO@s4kw5GiVFxklVmCvbaMPqLBDuz/24EIZ2T6rFqmL2MsmYFZFA8eQ3MgaIf5Xy0phKg0QiZBXkeOwgRJyd6EZ2J7dEmDUMe9UqFcRjLFtu0H^0|0|5|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://github.com/ConorOBrien-Foxx/Pyramid-Scheme" rel="nofollow noreferrer">Pyramid Scheme</a>, 965 bytes</h1>
<pre><code>    ^
   / \
  /do \
 ^-----^
/!\    -^
---^    -^
  /=\    -^
 ^---^    -^
/a\ / \    -^
---/26 \   /[\
   -----  ^---^
         ^-  /[\
        ^-  ^---^
       ^-  / \  -^
      ^-  /set\  -^
     ^-  ^-----^  -^
    / \ /b\   /a\  -^
   /set\---   ---  /[\
  ^-----^         ^---^
 /a\   /+\       / \  -^
 ---  ^---^     /do \  -^
     /a\ /1\   ^-----^  -^
     --- ---  /b\   /[\  -^
              ---  ^---^  -^
                  / \  -^  -^
                 /set\  -^  -^
                ^-----^  -^  -^
               /b\   /-\  -^  -^
               ---  ^---^  -^  -^
                   /b\ /1\ / \  -^
                   --- ---/out\ / \
                         ^-----/out\ 
                        / \   ^-----
                       /chr\ / \
                      ^-----/chr\
                     /+\    -----^
                    ^---^       / \
                   /a\ / \     /10 \
                   ---/96 \    -----
                      -----
</code></pre>
<p><a href="https://tio.run/##fVM7DoMwDN05RTpXyG0HpA49SaNI/CQ6ICqgQ09P408@iKQeQmI/P78Y5/2d6/HVlUs79GO/bcqaKewCStsPdBN@TYlmCjhpBNgdHmVrUQ/nJqQLQK2RJmTAraIjPJFbEaniFDyzmdID/HkHIQDyeBd5ln6NfC6L1IgTk6AhAbWHUh7pULRyaZ/qa5IAylNw1uL2MsJF2I9tC2KoEVetjpIokes20pnoXs5i9kMw0pGO@s4kw5GiVFxklVmCvbaMPqLBDuz/24EIZ2T6rFqmL2MsmYFZFA8eQ3MgaIf5Xy0phKg0QiZBXkeOwgRJyd6EZ2J7dEmDUMe9UqFcRjLFtu0H" rel="nofollow noreferrer" title="Pyramid Scheme – Try It Online">Try it online!</a></p>
<p>Wow this thing is huge. Nested loops result in a very big program.</p>


blocks|key|159870|text|Lua，48字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|159871|for+i=1,26+do+print(string.char(i%2B96):rep(i))end|code-block|syntax|javascript|159872|在网上试试！|unstyled|159873|解释：|159874|for+i=1,26+do+...+end+-尝试1到26之间的所有数字。|ordered-list-item|style|CODE|159875|print(...)+-指纹.|159876|string.char(i%2B96)+-获取字母表字符数i。|159877|:rep(i)+-重复焦炭i时间。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.lua.org/|1|https://tio.run/##yylN/P8/Lb9IIdPWUMfITCElX6GgKDOvRKO4BEil6yVnJBZpZGpbmmlaFaUWaGRqaqbmpfz/DwA^0|0|3|0|0|0|0|6|1|0|0|0|L|0|0|A|0|0|H|R|1|0|0|7|D|1^^$0|@$1|2|3|4|5|6|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|D|3|E|5|F|7|1B|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]|$1|L|3|M|5|K|7|1G|8|@]|9|@]|C|$]]|$1|N|3|O|5|P|7|1H|8|@$A|1I|B|1J|Q|R]]|9|@]|C|$]]|$1|S|3|T|5|P|7|1K|8|@$A|1L|B|1M|Q|R]]|9|@]|C|$]]|$1|U|3|V|5|P|7|1N|8|@$A|1O|B|1P|Q|R]|$A|1Q|B|1R|Q|R]]|9|@]|C|$]]|$1|W|3|X|5|P|7|1S|8|@$A|1T|B|1U|Q|R]|$A|1V|B|1W|Q|R]]|9|@]|C|$]]]|Y|$Z|$5|10|11|12|C|$13|14]]|15|$5|10|11|12|C|$13|16]]]]

<h1><a href="https://www.lua.org" rel="nofollow noreferrer">Lua</a>, 48 bytes</h1>



<pre class="lang-lua prettyprint-override"><code>for i=1,26 do print(string.char(i+96):rep(i))end
</code></pre>

<p><a href="https://tio.run/##yylN/P8/Lb9IIdPWUMfITCElX6GgKDOvRKO4BEil6yVnJBZpZGpbmmlaFaUWaGRqaqbmpfz/DwA" rel="nofollow noreferrer" title="Lua – Try It Online">Try it online!</a></p>

<p>Explanation:</p>

<ol>
<li><code>for i=1,26 do ... end</code> — try all numbers between 1 and 26.</li>
<li><code>print(...)</code> — prints, of couse.</li>
<li><code>string.char(i+96)</code> — get alphabet char number <code>i</code>.</li>
<li><code>:rep(i)</code> — repeat char <code>i</code> times.</li>
</ol>


blocks|key|1298277|text|行政协调会！！，74字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1298278|97
Count+i+while+i-27+{
+	Count+t+while+t-i+{
+		Write+_%2Bi-1
	}
Write+10
}|code-block|syntax|javascript|1298279|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/dloscutoff/Esolangs/tree/master/Acc!!|1|https://tio.run/##S0xOTkr6/9/SnMs5vzSvRCFToTwjMydVIVPXyFyhmkuBEyJcAhUu0c0Ei3KGF2WWpCrEa2fqGnJx1nJBuIYGXLX//wMA^0|0|7|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/dloscutoff/Esolangs/tree/master/Acc!!" rel="nofollow noreferrer">Acc!!</a>, 74 bytes</h1>

<pre><code>97
Count i while i-27 {
 &#9;Count t while t-i {
 &#9;&#9;Write _+i-1
&#9;}
Write 10
}
</code></pre>

<p><a href="https://tio.run/##S0xOTkr6/9/SnMs5vzSvRCFToTwjMydVIVPXyFyhmkuBEyJcAhUu0c0Ei3KGF2WWpCrEa2fqGnJx1nJBuIYGXLX//wMA" rel="nofollow noreferrer" title="Acc!! – Try It Online">Try it online!</a></p>


blocks|key|160508|text|Wolfram语言(数学)，43字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|160509|此提交将准确地创建指定的输出字符串，换句话说，它不是一个字符串括起来的字符数组。|unstyled|160510|#~Table~#2<>"\n"&~MapIndexed~Alphabet[]<>""|code-block|syntax|javascript|160511|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://www.wolfram.com/wolframscript/|1|https://tio.run/##y00syUjNTSzJTE78n6Zgq/BfuS4kMSkntU7ZyMZOKSZPSa3ON7HAMy8ltSI1pc4xpyAjMSm1JDoWKKn0P6AoM6/EIe0/AA^0|0|D|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://www.wolfram.com/wolframscript/" rel="nofollow noreferrer">Wolfram Language (Mathematica)</a>, 43 bytes</h1>

<p>This submission creates the specified output string exactly - in other words, it's NOT an array of string-enclosed characters.</p>

<pre><code>#~Table~#2&lt;&gt;"\n"&amp;~MapIndexed~Alphabet[]&lt;&gt;""
</code></pre>

<p><a href="https://tio.run/##y00syUjNTSzJTE78n6Zgq/BfuS4kMSkntU7ZyMZOKSZPSa3ON7HAMy8ltSI1pc4xpyAjMSm1JDoWKKn0P6AoM6/EIe0/AA" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>


blocks|key|160608|text|咄咄逼人，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|160609|Z26:q&Kh|code-block|syntax|javascript|160610|在网上试试！|160611|Z++++++++++\+Push+0+to+the+stack
+26:+++++++\+26+times+do:
++++q++++++\++++Print+stack,+with+each+number+as+its+letter+in+the+0-indexed+lower+alphabet
+++++&+++++\++++Make+a+copy+of+the+last+number
++++++Kh+++\++++Increment+all+numbers|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/FTcode/Pushy|1|https://tio.run/##Kygtzqj8/z/KyMyqUM074/9/AA^0|0|4|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|V|8|@]|9|@$A|W|B|X|1|Y]]|C|$]]|$1|D|3|E|5|F|7|Z|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|K|3|L|5|F|7|14|8|@]|9|@]|C|$G|H]]]|M|$N|$5|O|P|Q|C|$R|S]]|T|$5|O|P|Q|C|$R|U]]]]

<h1><a href="https://github.com/FTcode/Pushy" rel="nofollow noreferrer">Pushy</a>, 8 bytes</h1>

<pre><code>Z26:q&amp;Kh
</code></pre>

<p><strong><a href="https://tio.run/##Kygtzqj8/z/KyMyqUM074/9/AA" rel="nofollow noreferrer" title="Pushy – Try It Online">Try it online!</a></strong></p>

<pre><code>Z          \ Push 0 to the stack
 26:       \ 26 times do:
    q      \    Print stack, with each number as its letter in the 0-indexed lower alphabet
     &amp;     \    Make a copy of the last number
      Kh   \    Increment all numbers
</code></pre>


blocks|key|1298605|text|Kotlin，76字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1298606|for(i+in+0..25){var+j=0;while(j<=i){print((i%2B97).toChar());j%2B%2B};print("\n")}|code-block|syntax|javascript|1298607|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://kotlinlang.org/|1|https://tio.run/##JcrBCsIwDADQXyk7JRTKGIhoN0H8BK9ecnBb6kwldoqUfnsVPL93i2lhqeMq5k4sQDo990dV@vTnpCzTAXMdowIbFtM6120wv0hNGFr/nnm5QugHxvz45QTAdrdFl@JpJgVEH6wt/m/NRRostdQv^0|0|6|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://kotlinlang.org" rel="nofollow noreferrer">Kotlin</a>, 76 bytes</h1>

<pre><code>for(i in 0..25){var j=0;while(j&lt;=i){print((i+97).toChar());j++};print("\n")}
</code></pre>

<p><a href="https://tio.run/##JcrBCsIwDADQXyk7JRTKGIhoN0H8BK9ecnBb6kwldoqUfnsVPL93i2lhqeMq5k4sQDo990dV@vTnpCzTAXMdowIbFtM6120wv0hNGFr/nnm5QugHxvz45QTAdrdFl@JpJgVEH6wt/m/NRRostdQv" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|161342|text|x86-64机器代码函数，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|161343|对于具有非标准调用约定的x86-32的18个字节，inc+eax仅为1B与2B。|unstyled|offset|length|style|CODE|161344|从C(具有x86-64+System调用约定)调用为：|161345|void+alphabet_staircase(char+output[377]);

//+or
struct+string_result+{+char+buf[377];+}++\
++alphabet_staircase(void);+++//+return-value+pointer+passed+as+implicit+first+arg|code-block|syntax|javascript|161346|也就是说，它将一个平面字符串(包括'\n'换行符)存储到rdi指向的缓冲区中。|161347|0000000000400080+<alphabet_staircase>:
++400080:+++++++6a+61+++++++++++push+++0x61
++400082:+++++++58++++++++++++++pop++++rax++++++;+eax+=+'a'

0000000000400083+<alphabet_staircase.loop>:
+++++++++++++++++++++++++++++++++;;;+do+{
++400083:+++++++8d+48+a1++++++++lea++++ecx,[rax-0x5f]++++++;+rax-'a'%2B1+%2B+1
++400086:+++++++f3+aa+++++++++++rep+stos+BYTE+PTR+es:[rdi],al
++400088:+++++++c6+47+ff+0a+++++mov++++BYTE+PTR+[rdi-0x1],0xa
++40008c:+++++++ff+c0+++++++++++inc++++eax
++40008e:+++++++3c+7a+++++++++++cmp++++al,0x7a
++400090:+++++++76+f1+++++++++++jbe++++400083+<alphabet_staircase.loop>
+++++++++++++++++++++++++++++++++;;;+}+while(al+<=+'z')
++400092:+++++++c3++++++++++++++ret

++400093++end+of+function.++0x93+-+0x80+=+0x13+=+19+bytes|161348|在网上试试！+(包括用sys_write()打印结果的_start调用方)|161349|在每个循环迭代中，我们存储一个当前字母的额外副本，然后用换行符覆盖它。rep+stosb+=+memset(rdi,+al,+rcx)。它将rdi推进到它存储的字节的一个过端.|161350|eax保存当前字母，我们使用它作为循环计数器。do+{}+while(eax+<=+'z');。使用LEA设置rcx需要对eax的上字节进行零化，否则我们可以使用2字节mov+al,+'a'启动。|161351|x86-64+SysV+ABI要求在函数输入/退出时清除DF，因此我们不需要cld。如果我们想要使用std向后存储，它不会解决在寻址模式中需要一个偏移量来存储换行符的问题(或者需要一个单独的inc/dec，或者用reg+holding+0x10交换eax，并使用stosb存储换行符)；stosb总是覆盖rdi所指向的内存。|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##fVJLT8MwDL7nV/i2jXWwFrQDO@2AENLEgRMSQlPSeiwobUqcQsefH05aWHmISEllx/kediURlsrsZ5Wk8nAQq/XN9S0sLsQSXq0uYDvOd9LBiSv0RDwZq6QBaeqdVOg35KV2uSQUv1OXQgCvJZT2lV8kMJIj@LaWkIHae6QEVONhfbUCXXkLLm/B4UujHRKs1vCOzs6w9VgVWHQlV6v7iF43tIOA3EW25tPJVohTY219GbMGJZ@Ytwk88B3MopIppGE/HsUwg5MxzwS6yh2WWHlg47C1DiRU@GZ0hRHUYQ3kLakYBYsQvTBFoWfpYwLzVsJPv0MEZgiyWGyI8jJIj21678w8K@Qz@hA9pReHr/H0owj9dl50n77l1CiupjqBdJ5d9NTGegK7BapljkfRrDYJtZ0Iaf4c7rGc5TLq0dBmc3u3eXPaDyAxQA5qyBe28QNK6ig/71WzHT5mgmxxMs4W03QCZ/yLTDn@rL2WDdGIwkDKxvC0@KpvKnXe9xRdfGs7J3uRP5xk52nMtDzfqJv3/zDYaj@eT8ThAw^0|0|P|7|0|0|0|H|4|S|3|0|0|B|B|R|6|0|6|0|0|Z|W|1Y|3|0|0|3|N|O|1J|3|1P|3|2C|B|0|12|3|1E|3|2N|3|2R|3|3A|4|3G|3|3N|5|3Z|5|48|3^^$0|@$1|2|3|4|5|6|7|18|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|19|8|@$E|1A|F|1B|G|H]]|9|@]|A|$]]|$1|I|3|J|5|D|7|1C|8|@]|9|@]|A|$]]|$1|K|3|L|5|M|7|1D|8|@]|9|@]|A|$N|O]]|$1|P|3|Q|5|D|7|1E|8|@$E|1F|F|1G|G|H]|$E|1H|F|1I|G|H]]|9|@]|A|$]]|$1|R|3|S|5|M|7|1J|8|@]|9|@]|A|$N|O]]|$1|T|3|U|5|D|7|1K|8|@$E|1L|F|1M|G|H]|$E|1N|F|1O|G|H]]|9|@$E|1P|F|1Q|1|1R]]|A|$]]|$1|V|3|W|5|D|7|1S|8|@$E|1T|F|1U|G|H]|$E|1V|F|1W|G|H]]|9|@]|A|$]]|$1|X|3|Y|5|D|7|1X|8|@$E|1Y|F|1Z|G|H]|$E|20|F|21|G|H]|$E|22|F|23|G|H]|$E|24|F|25|G|H]|$E|26|F|27|G|H]]|9|@]|A|$]]|$1|Z|3|10|5|D|7|28|8|@$E|29|F|2A|G|H]|$E|2B|F|2C|G|H]|$E|2D|F|2E|G|H]|$E|2F|F|2G|G|H]|$E|2H|F|2I|G|H]|$E|2J|F|2K|G|H]|$E|2L|F|2M|G|H]|$E|2N|F|2O|G|H]|$E|2P|F|2Q|G|H]]|9|@]|A|$]]]|11|$12|$5|13|14|15|A|$16|17]]]]

<h1>x86-64 machine code function, 19 bytes</h1>

<p><strong>18 bytes for x86-32 with a non-standard calling convention</strong>, <code>inc eax</code> is only 1B vs. 2B.</p>

<p>Callable from C (with the x86-64 System V calling convention) as:</p>

<pre><code>void alphabet_staircase(char output[377]);

// or
struct string_result { char buf[377]; }  \
  alphabet_staircase(void);   // return-value pointer passed as implicit first arg
</code></pre>

<p>i.e. it stores a flat string (including <code>'\n'</code> newlines) into a buffer pointed to by <code>rdi</code>.</p>

<pre><code>0000000000400080 &lt;alphabet_staircase&gt;:
  400080:       6a 61           push   0x61
  400082:       58              pop    rax      ; eax = 'a'

0000000000400083 &lt;alphabet_staircase.loop&gt;:
                                 ;;; do {
  400083:       8d 48 a1        lea    ecx,[rax-0x5f]      ; rax-'a'+1 + 1
  400086:       f3 aa           rep stos BYTE PTR es:[rdi],al
  400088:       c6 47 ff 0a     mov    BYTE PTR [rdi-0x1],0xa
  40008c:       ff c0           inc    eax
  40008e:       3c 7a           cmp    al,0x7a
  400090:       76 f1           jbe    400083 &lt;alphabet_staircase.loop&gt;
                                 ;;; } while(al &lt;= 'z')
  400092:       c3              ret

  400093  end of function.  0x93 - 0x80 = 0x13 = 19 bytes
</code></pre>

<p><a href="https://tio.run/##fVJLT8MwDL7nV/i2jXWwFrQDO@2AENLEgRMSQlPSeiwobUqcQsefH05aWHmISEllx/kediURlsrsZ5Wk8nAQq/XN9S0sLsQSXq0uYDvOd9LBiSv0RDwZq6QBaeqdVOg35KV2uSQUv1OXQgCvJZT2lV8kMJIj@LaWkIHae6QEVONhfbUCXXkLLm/B4UujHRKs1vCOzs6w9VgVWHQlV6v7iF43tIOA3EW25tPJVohTY219GbMGJZ@Ytwk88B3MopIppGE/HsUwg5MxzwS6yh2WWHlg47C1DiRU@GZ0hRHUYQ3kLakYBYsQvTBFoWfpYwLzVsJPv0MEZgiyWGyI8jJIj21678w8K@Qz@hA9pReHr/H0owj9dl50n77l1CiupjqBdJ5d9NTGegK7BapljkfRrDYJtZ0Iaf4c7rGc5TLq0dBmc3u3eXPaDyAxQA5qyBe28QNK6ig/71WzHT5mgmxxMs4W03QCZ/yLTDn@rL2WDdGIwkDKxvC0@KpvKnXe9xRdfGs7J3uRP5xk52nMtDzfqJv3/zDYaj@eT8ThAw" rel="nofollow noreferrer" title="Assembly (nasm, x64, Linux) – Try It Online">Try it online!</a>  (including a <code>_start</code> caller that prints the result with <code>sys_write()</code>)</p>

<p>In each loop iteration, we store one extra copy of current letter, then overwrite it with a newline.  <code>rep stosb = memset(rdi, al, rcx)</code>.  It advances <code>rdi</code> to point one-past-the-end of the bytes it stored.</p>

<p><code>eax</code> holds the current letter, and we use it as the loop counter.  <code>do {} while(eax &lt;= 'z');</code>.  Setting <code>rcx</code> from it with LEA requires that the upper bytes of <code>eax</code> be zeroed, otherwise we could use 2-byte <code>mov al, 'a'</code> to start.</p>

<p>The x86-64 SysV ABI requires that DF is cleared on function entry/exit, so we don't need <code>cld</code>.  If we wanted to use <code>std</code> to store backwards, it wouldn't solve the problem of needing an offset of one in an addressing mode to store the newline (or needing a separate <code>inc</code>/<code>dec</code>, or swapping <code>eax</code> with a reg holding <code>0x10</code> and using <code>stosb</code> to store a newline); <code>stosb</code> always overwrites the memory <code>rdi</code> is pointing to.</p>


blocks|key|161452|text|F#+(.NET+Core)，58字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|161453|58字节|161454|[1..26]%7C>Seq.map(fun+i->new+System.String((char)(i%2B96),i))|code-block|syntax|javascript|161455|在网上试试！|unstyled|161456|我的C#答案的基本端口。|161457|59字节|161458|[1..26]%7C>Seq.map(fun+i->[1..i]%7C>Seq.map(fun+_->i%2B96%7C>char))|161459|161460|答案与上面相同，但没有`System.String。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.microsoft.com/net/core/platform|1|https://tio.run/##SyvWTc4vSv2vr5@TWqKQbhttqKdnZBZbYxecWqiXm1igkVaap5CpawcSz0QTjte1y9S2NKuxS85ILNLU5AKZkGb7XwEIcBmTl1quEFxZXJKaqxdcUpSZl66hAdasATJIUydTU/N/AVC4JC1PQUnVUUkhjUtfH0Ug/T8A|2|https://codegolf.stackexchange.com/a/147708/15214|3|https://tio.run/##SyvWTc4vSv2fk1qikGb7XwEIog319IzMYmvsglML9XITCzTSSvMUMnXtQOKZaMLxunaZ2pZmNXbJGYlFmpr/C4oy80rS8hSUVB2VFNL@AwA^0|0|E|0|0|0|0|0|6|1|0|2|4|2|0|0|0|0|6|3|0^^$0|@$1|2|3|4|5|6|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|D|3|E|5|6|7|1D|8|@]|9|@]|C|$]]|$1|F|3|G|5|H|7|1E|8|@]|9|@]|C|$I|J]]|$1|K|3|L|5|M|7|1F|8|@]|9|@$A|1G|B|1H|1|1I]]|C|$]]|$1|N|3|O|5|M|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|P|3|Q|5|6|7|1N|8|@]|9|@]|C|$]]|$1|R|3|S|5|H|7|1O|8|@]|9|@]|C|$I|J]]|$1|T|3|L|5|M|7|1P|8|@]|9|@$A|1Q|B|1R|1|1S]]|C|$]]|$1|U|3|V|5|M|7|1T|8|@]|9|@]|C|$]]]|W|$X|$5|Y|Z|10|C|$11|12]]|13|$5|Y|Z|10|C|$11|14]]|15|$5|Y|Z|10|C|$11|16]]|17|$5|Y|Z|10|C|$11|18]]]]

<h1><a href="https://www.microsoft.com/net/core/platform" rel="nofollow noreferrer">F# (.NET Core)</a>, 58 bytes</h1>

<h2>58 bytes</h2>



<pre class="lang-fs prettyprint-override"><code>[1..26]|&gt;Seq.map(fun i-&gt;new System.String((char)(i+96),i))
</code></pre>

<p><a href="https://tio.run/##SyvWTc4vSv2vr5@TWqKQbhttqKdnZBZbYxecWqiXm1igkVaap5CpawcSz0QTjte1y9S2NKuxS85ILNLU5AKZkGb7XwEIcBmTl1quEFxZXJKaqxdcUpSZl66hAdasATJIUydTU/N/AVC4JC1PQUnVUUkhjUtfH0Ug/T8A" rel="nofollow noreferrer" title="F# (.NET Core) – Try It Online">Try it online!</a></p>

<p>A basic port of my <a href="https://codegolf.stackexchange.com/a/147708/15214">C# answer</a>.</p>

<h2>59 bytes</h2>



<pre class="lang-fs prettyprint-override"><code>[1..26]|&gt;Seq.map(fun i-&gt;[1..i]|&gt;Seq.map(fun _-&gt;i+96|&gt;char))
</code></pre>

<p><a href="https://tio.run/##SyvWTc4vSv2fk1qikGb7XwEIog319IzMYmvsglML9XITCzTSSvMUMnXtQOKZaMLxunaZ2pZmNXbJGYlFmpr/C4oy80rS8hSUVB2VFNL@AwA" rel="nofollow noreferrer" title="F# (.NET Core) – Try It Online">Try it online!</a></p>

<p>Same answer as above but without `System.String.</p>


blocks|key|1299452|text|Javascript+(ES6)+61字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1299453|_=>[...Array(26)].map((_,i)=>(10%2Bi).toString(36).repeat(i%2B1))|code-block|syntax|javascript|1299454|Javascript+(ES6)+62字节|1299455|_=>[..."abcdefghijklmnopqrstuvwxyz"].map((v,i)=>v.repeat(i%2B1))|1299456|我知道对于js已经有了更好的答案，仍然想发布这些，只要它保持“方法”不变，就可以随意建议任何改进。(对于未使用变量使用下划线的可读性im+)|unstyled|entityMap^0|0|0|0|0^^$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|6|7|Q|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|K|3|L|5|M|7|S|8|@]|9|@]|A|$]]]|N|$]]

<h1>Javascript (ES6) 61 bytes</h1>

<pre><code>_=&gt;[...Array(26)].map((_,i)=&gt;(10+i).toString(36).repeat(i+1))
</code></pre>

<h1>Javascript (ES6) 62 bytes</h1>

<pre><code>_=&gt;[..."abcdefghijklmnopqrstuvwxyz"].map((v,i)=&gt;v.repeat(i+1))
</code></pre>

<p>I'm aware there's a better answer already for js, still wanted to post these, feel free to suggest any improvement as long as it keeps the "methodology" intact. (for readability im using underscores for unused variables)</p>


<h1>JsFuck, 7929c</h1>

<pre><code>[][(![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]]+([![]]+[][[]])[+!![]+[+[]]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[!![]+!![]+!![]]][([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(![]+[])[+!![]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]]([!![]]+[][[]]+[][[]]+!![])[(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+!![]]]([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+!![]]][([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((![]+[])[+[]]+([]+[])[(![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]()[+!![]+[+!![]]]+(+!![])+(+[])+(+[![]]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+[+[]]]+(!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]]+[])[!![]+!![]+[+[]]]+[][[]]+([]+[])[(![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]()[+!![]+[+!![]]]+([]+[])[(![]+[])[!![]+!![]+!![]]+([][[]]+[])[+[]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]]]()[+!![]+[+[]]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[])[!![]+!![]+!![]]+(+(+!![]+[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+!![])+(+[]))+[])[+!![]]+(![]+[])[!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(+[]+[![]]+([]+[])[([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]])[!![]+!![]+[+[]]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[!![]+!![]+!![]]]+(![]+[])[+[]]+(+(+!![]+[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+!![])+(+[]))+[])[+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([]+[])[([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]][([][[]]+[])[+!![]]+(![]+[])[+!![]]+([]+(+[])[([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]])[+!![]+[+!![]]]+(!![]+[])[!![]+!![]+!![]]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[!![]+!![]+!![]]]+(!![]+!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![])+(+[]+[![]]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+[+[]]]+(+(+!![]+[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+!![])+(+[]))+[])[+!![]]+(!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(+[![]]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]][([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]]+[])[!![]+!![]+[+[]]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(![]+[])[+!![]])()([][[]]))[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[!![]+!![]+!![]]]+(+(+!![]+(!![]+[])[!![]+!![]+!![]]+(+!![])+(+[])+(+[]))+[])[!![]+!![]]+(+(+!![]+(!![]+[])[!![]+!![]+!![]]+(+!![])+(+[])+(+[]))+[])[!![]+!![]]+(![]+[])[+[]]+(+((+(+!![]+[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+!![])+(+[]))+[])[+!![]]+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+[])+(+!![]))+[])[!![]+!![]]+(+!![])+(+[])+(+[]+[![]]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+[+[]]]+(+[]+[![]]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+[+[]]])())
</code></pre>

<p>From </p>

<pre><code>[].slice.call('trueundefinedundefinedtrue').filter([].filter.constructor('f=10\nreturn undefined=&gt;console.log(f.toString(36).repeat(++f-10))')())
</code></pre>

<h1>JsFuck, 7961c</h1>

<pre><code>[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+!![]]][([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]][([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]]+[])[!![]+!![]+[+[]]]+([][[]]+[])[+[]]+([][[]]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(![]+[])[+!![]]+(+[![]]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]][([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]]+[])[!![]+!![]+[+[]]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(![]+[])[+!![]])()([][[]]))[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]])()(((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+![]+(!![]+!![])+(+[])+(![]+[])[+[]]+![]+(!![]+!![]+!![])+([][[]]+[])[!![]+!![]]+![]+(!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![])+(!![]+[])[+[]]+![]+(!![]+!![]+!![])+([][[]]+[])[!![]+!![]]+(+!![])+(+[])+![]+(!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![])+![]+(!![]+!![]+!![])+([][[]]+[])[!![]+!![]]+![]+(!![]+!![]+!![])+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+![]+(!![]+!![])+([][[]]+[])[!![]+!![]]+(!![]+!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![])+![]+(!![]+!![]+!![])+(![]+[])[+[]]+(!![]+[])[+[]]+![]+(!![]+!![])+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+![]+(!![]+!![]+!![]+!![]+!![]+!![])+(![]+[])[+[]]+![]+(!![]+!![]+!![]+!![]+!![])+(!![]+!![]+!![])+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+![]+(!![]+!![]+!![]+!![]+!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![])+![]+(!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![])+(!![]+!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![])+![]+(!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![])+![]+(!![]+!![])+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+![]+(!![]+!![]+!![]+!![]+!![]+!![]+!![])+(+[])+(!![]+[])[!![]+!![]+!![]]+(![]+[])[+!![]]+(!![]+[])[+[]]+![]+(!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![])+(+(+!![]+(!![]+[])[!![]+!![]+!![]]+(+!![])+(+[])+(+[]))+[])[!![]+!![]]+(+(+!![]+(!![]+[])[!![]+!![]+!![]]+(+!![])+(+[])+(+[]))+[])[!![]+!![]]+(!![]+[])[+[]]+![]+(!![]+!![])+([][[]]+[])[!![]+!![]]+(+!![])+(+[])+![]+(!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![])+(+(+!![]+(!![]+[])[!![]+!![]+!![]]+(+!![])+(+[])+(+[]))+[])[!![]+!![]]+![]+(!![]+!![]+!![]+!![]+!![]+!![])+(+[])+![]+(+[])+(![]+[])[+!![]]+![]+(!![]+!![]+!![]+!![]+!![]+!![])+(+[])+(+(+!![]+(!![]+[])[!![]+!![]+!![]]+(+!![])+(+[])+(+[]))+[])[!![]+!![]]+(![]+[])[+[]]+![]+(!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![])+(!![]+[])[+[]]+![]+(!![]+!![])+(!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![]+!![])+![]+(!![]+!![]+!![])+(![]+[])[+!![]]+![]+(!![]+!![])+(!![]+!![])+![]+(!![]+!![])+(!![]+!![]))[(![]+[])[!![]+!![]+!![]]+(+[![]]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]][([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]]+[])[!![]+!![]+[+[]]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(![]+[])[+!![]])()([][[]]))[+!![]+[+[]]]+(![]+[])[!![]+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[+[]]](![])[([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([![]]+[][[]])[+!![]+[+[]]]+([][[]]+[])[+!![]]]([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]][([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][[]]+[])[+!![]]+(![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+[]]+([]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[!![]+!![]+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+(!![]+[])[+!![]]]((!![]+[])[+!![]]+(!![]+[])[!![]+!![]+!![]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!![]]+([][[]]+[])[+!![]]+([][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]]+[])[!![]+!![]+[+[]]]+(![]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+([![]]+[][[]])[+!![]+[+[]]]+(![]+[])[!![]+!![]]+(![]+[])[!![]+!![]]])[+!![]+[+[]]]+([][(!![]+[])[!![]+!![]+!![]]+([][[]]+[])[+!![]]+(!![]+[])[+[]]+(!![]+[])[+!![]]+([![]]+[][[]])[+!![]+[+[]]]+(!![]+[])[!![]+!![]+!![]]+(![]+[])[!![]+!![]+!![]]]()+[])[!![]+!![]])()(+[]+[+[]]+(+[])+(![]+[])[!![]+!![]])[!![]+!![]])))
</code></pre>

<p>From</p>

<pre><code>[].filter.constructor(unescape('returnfalse20ffalse3dfalse28tfalse3d10false29false3dfalse3etfalse2d36false3ftfalse2etfalse6ffalse53trinfalse67false2836false29false2erefalse70eatfalse28++tfalse2d10false29+false60false0afalse60+ffalse28tfalse29false3afalse22false22'.split(false).join('%')))
</code></pre>

<p>Both work on Firefox, because I only have it</p>


blocks|key|1300033|text|我的-基本，59字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300034|匿名函数，它不接受输入并输出到控制台。|unstyled|1300035|For+I=1+To+26
For+J=1+To+I
Print+Chr(I%2B64)
Next
Print;
Next|code-block|syntax|javascript|1300036|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/paladin-t/my_basic|1|https://tio.run/##y63UTUoszkz@/98tv0jB09ZQISRfwciMC8TzgvA8uQKKMvNKFJwzijQ8tc1MNLn8UitKIILWYPb//yEhAA^0|0|5|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://github.com/paladin-t/my_basic" rel="nofollow noreferrer">MY-BASIC</a>, 59 bytes</h1>

 

<p>Anonymous Function that takes no input and outputs to the console.</p>

<pre class="lang-vb prettyprint-override"><code>For I=1 To 26
For J=1 To I
Print Chr(I+64)
Next
Print;
Next
</code></pre>

<p><a href="https://tio.run/##y63UTUoszkz@/98tv0jB09ZQISRfwciMC8TzgvA8uQKKMvNKFJwzijQ8tc1MNLn8UitKIILWYPb//yEhAA" rel="nofollow noreferrer" title="MY-BASIC – Try It Online">Try it online!</a></p>


blocks|key|162172|text|亚伯基，49字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162173|一个基本的答案，不需要输入和输出到控制台。|unstyled|162174|For+I=1To+26
For+J=1To+I
?Chr$(I%2B64);
Next
?
Next|code-block|syntax|javascript|162175|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://www.yabasic.de/|1|https://tio.run/##q0xMSizOTP7/3y2/SMHT1jAkX8HIjAvE8QJzPLnsnTOKVDQ8tc1MNK25/FIrSrjswdT//wA^0|0|3|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="http://www.yabasic.de" rel="nofollow noreferrer">Yabasic</a>, 49 bytes</h1>

<p>
A BASIC answer that takes no input and outputs to the console.</p>

<pre class="lang-vb prettyprint-override"><code>For I=1To 26
For J=1To I
?Chr$(I+64);
Next
?
Next
</code></pre>

<p><a href="https://tio.run/##q0xMSizOTP7/3y2/SMHT1jAkX8HIjAvE8QJzPLnsnTOKVDQ8tc1MNK25/FIrSrjswdT//wA" rel="nofollow noreferrer" title="Yabasic – Try It Online">Try it online!</a></p>


blocks|key|1300159|text|Visual+Basic+.NET+(Mono)，120字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300160|另一个基本答案|unstyled|1300161|Module+M
Sub+Main
Dim+S,I,J
For+I=1To+26
S=""
For+J=1To+I
S%2B=Chr(I%2B64)
Next
Console.WriteLine(S)
Next
End+Sub
End+Module|code-block|syntax|javascript|1300162|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://www.mono-project.com/docs/about-mono/languages/visualbasic/|1|https://tio.run/##LY09C8IwFAD39ytCp0obQZFumapCinGJ4JzagIH0PciH@O@jRKeDu@FeLmbj@Wyie3C0ia@EVIqiJXvLFOg8M2UcwtGtTPeyn@BMgUmxuxHbD6BF01QzVSNBd2J8hlZ2w2EDV/tOMBJG8nZ7Dy7Zi0Pb6n854cK@g8rfsZQP^0|0|O|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="http://www.mono-project.com/docs/about-mono/languages/visualbasic/" rel="nofollow noreferrer">Visual Basic .NET (Mono)</a>, 120 bytes</h1>



<p>Another BASIC answer</p>

<pre class="lang-vb prettyprint-override"><code>Module M
Sub Main
Dim S,I,J
For I=1To 26
S=""
For J=1To I
S+=Chr(I+64)
Next
Console.WriteLine(S)
Next
End Sub
End Module
</code></pre>

<p><a href="https://tio.run/##LY09C8IwFAD39ytCp0obQZFumapCinGJ4JzagIH0PciH@O@jRKeDu@FeLmbj@Wyie3C0ia@EVIqiJXvLFOg8M2UcwtGtTPeyn@BMgUmxuxHbD6BF01QzVSNBd2J8hlZ2w2EDV/tOMBJG8nZ7Dy7Zi0Pb6n854cK@g8rfsZQP" rel="nofollow noreferrer" title="Visual Basic .NET (Mono) – Try It Online">Try it online!</a></p>


blocks|key|162272|text|佩佩，49字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162273|rEeEEeeeeEREeEEEEeEEREEreeereeErEEEeErEEEEEeeERee|code-block|syntax|javascript|162274|在网上试试！|unstyled|162275|解释：|162276|rEeEEeeeeE+#+Push+A+(r)
REeEEEEeEE+#+Push+91+(Z+%2B+1)+(R)
REE++++++++#+Start+loop+labeled+91
+++++++++++#+%7C+All+the+following+commands+below+operate+on+r
reee+++++++#+%7C+Output+whole+stack+of+r
reeE+++++++#+%7C+Output+newline+"\n"
rEEEeE+++++#+%7C+Duplicate+char+to+end
rEEEEEeeE++#+%7C+Increment+whole+stack
Ree++++++++#+If+r+!=+91,+repeat+loop|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com//github.com/Soaku/Pepe|1|https://codegolf.stackexchange.com//soaku.github.io/Pepe/^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|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="//github.com/Soaku/Pepe" rel="nofollow noreferrer">Pepe</a>, 49 bytes</h1>
<pre><code>rEeEEeeeeEREeEEEEeEEREEreeereeErEEEeErEEEEEeeERee
</code></pre>
<p><a href="//soaku.github.io/Pepe/#!c2!djFGI-eS2/" rel="nofollow noreferrer">Try it online!</a></p>
<p>Explanation:</p>
<pre><code>rEeEEeeeeE # Push A (r)
REeEEEEeEE # Push 91 (Z + 1) (R)
REE        # Start loop labeled 91
           # | All the following commands below operate on r
reee       # | Output whole stack of r
reeE       # | Output newline &quot;\n&quot;
rEEEeE     # | Duplicate char to end
rEEEEEeeE  # | Increment whole stack
Ree        # If r != 91, repeat loop
</code></pre>


blocks|key|1300306|text|sed，82字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300307|s:%5E:a:
:A
p
y:abcdefghijklmnopqrstuvwxy:bcdefghijklmnopqrstuvwxyz:
s:.:&&:
/z/q
bA|code-block|syntax|javascript|1300308|在网上试试！|unstyled|1300309|循环从a到z。最后一行是隐式打印的，前面的行用p打印。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/sed/|1|https://tio.run/##K05N0U3PK/3/v9gqzirRisvKkauAq9IqMSk5JTUtPSMzKzsnNy@/oLCouKS0rLyi0gqXRJUVV7GVnpWamhWXfpV@IVeS4///AA^0|0|3|0|0|0|0|6|1|0|3|1|5|1|N|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]|$A|1C|B|1D|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://www.gnu.org/software/sed/" rel="nofollow noreferrer">sed</a>, 82 bytes</h1>

<pre><code>s:^:a:
:A
p
y:abcdefghijklmnopqrstuvwxy:bcdefghijklmnopqrstuvwxyz:
s:.:&amp;&amp;:
/z/q
bA
</code></pre>

<p><a href="https://tio.run/##K05N0U3PK/3/v9gqzirRisvKkauAq9IqMSk5JTUtPSMzKzsnNy@/oLCouKS0rLyi0gqXRJUVV7GVnpWamhWXfpV@IVeS4///AA" rel="nofollow noreferrer" title="sed – Try It Online">Try it online!</a></p>

<p>Loop from <code>a</code> to <code>z</code>. The last line is printed implicitly, preceding lines are printed with a <code>p</code>.</p>


blocks|key|1300327|text|MBASIC，42字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300328|1+FOR+I=1+TO+26:PRINT+STRING$(I,96%2BI):NEXT|code-block|syntax|javascript|entityMap|0|LINK|mutability|MUTABLE|url|https://archive.org/details/BASIC-80_MBASIC_Reference_Manual^0|0|6|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]]|C|$]]|$1|D|3|E|5|F|7|T|8|@]|9|@]|C|$G|H]]]|I|$J|$5|K|L|M|C|$N|O]]]]

<h1><a href="https://archive.org/details/BASIC-80_MBASIC_Reference_Manual" rel="nofollow noreferrer">MBASIC</a>, 42 bytes</h1>

<pre><code>1 FOR I=1 TO 26:PRINT STRING$(I,96+I):NEXT
</code></pre>


blocks|key|162357|text|白空间，127个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162358|因为语法完全是空格字符，所以每个字符都以S、T或L作为前缀(分别表示空格、Tab和Linefeed+)。|unstyled|162359|S+S+S+T	L
L
S+S+L
S+L
S+S+L
S+S+S+S+T	T	S+S+S+S+S+L
T	S+S+S+L
S+S+T	L
S+L
S+T	L
S+S+S+L
T	S+S+S+T	L
T	S+S+T	S+L
S+L
T	S+T	S+L
S+L
T	L
S+L
T	L
L
S+S+T	S+L
S+L
L
S+L
L
S+S+S+T	S+T	S+L
T	L
S+S+S+S+S+T	L
T	S+S+S+S+L
S+S+S+S+T	T	S+T	T	L
T	S+S+T	L
T	T	L
L
L
L|code-block|syntax|javascript|162360|试试看只有空格版本的在线！|entityMap|0|LINK|mutability|MUTABLE|url|https://web.archive.org/web/20150618184706/http://compsoc.dur.ac.uk/whitespace/tutorial.php|1|https://tio.run/##RUxBCsAwCDsnr8jXyiist0EHe74zrmWiiSbqc467z6sdPUISSIkq8AijaKLdRHArMMLrWFTFJVa6RznaF/9vfB@YnBHxAg^0|0|3|0|0|0|0|0|D|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://web.archive.org/web/20150618184706/http://compsoc.dur.ac.uk/whitespace/tutorial.php" rel="nofollow noreferrer">Whitespace</a>, 127 bytes</h1>

<p>Because the syntax is entirely in whitespace characters, each character is prefixed with S, T, or L (for Space, Tab, and Linefeed, respectively).</p>

<pre><code>S S S T&#9;L
L
S S L
S L
S S L
S S S S T&#9;T&#9;S S S S S L
T&#9;S S S L
S S T&#9;L
S L
S T&#9;L
S S S L
T&#9;S S S T&#9;L
T&#9;S S T&#9;S L
S L
T&#9;S T&#9;S L
S L
T&#9;L
S L
T&#9;L
L
S S T&#9;S L
S L
L
S L
L
S S S T&#9;S T&#9;S L
T&#9;L
S S S S S T&#9;L
T&#9;S S S S L
S S S S T&#9;T&#9;S T&#9;T&#9;L
T&#9;S S T&#9;L
T&#9;T&#9;L
L
L
L

</code></pre>

<p><a href="https://tio.run/##RUxBCsAwCDsnr8jXyiist0EHe74zrmWiiSbqc467z6sdPUISSIkq8AijaKLdRHArMMLrWFTFJVa6RznaF/9vfB@YnBHxAg" rel="nofollow noreferrer" title="Whitespace – Try It Online">Try the whitespace-only version online!</a></p>


blocks|key|1300487|text|K4，13字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300488|(1%2B!26)#'.Q.a|code-block|syntax|javascript|1300489|输出：|unstyled|1300490|q)k)(1%2B!26)#'.Q.a
,"a"
"bb"
"ccc"
"dddd"
"eeeee"
"ffffff"
"ggggggg"
"hhhhhhhh"
"iiiiiiiii"
"jjjjjjjjjj"
"kkkkkkkkkkk"
"llllllllllll"
"mmmmmmmmmmmmm"
"nnnnnnnnnnnnnn"
"ooooooooooooooo"
"pppppppppppppppp"
"qqqqqqqqqqqqqqqqq"
"rrrrrrrrrrrrrrrrrr"
"sssssssssssssssssss"
"tttttttttttttttttttt"
"uuuuuuuuuuuuuuuuuuuuu"
"vvvvvvvvvvvvvvvvvvvvvv"
"wwwwwwwwwwwwwwwwwwwwwww"
"xxxxxxxxxxxxxxxxxxxxxxxx"
"yyyyyyyyyyyyyyyyyyyyyyyyy"
"zzzzzzzzzzzzzzzzzzzzzzzzzz"|entityMap|0|LINK|mutability|MUTABLE|url|http://kx.com/download^0|0|2|0|0|0|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|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|10|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]]]

<h1><a href="http://kx.com/download" rel="nofollow noreferrer">K4</a>, 13 bytes</h1>
<pre><code>(1+!26)#'.Q.a
</code></pre>
<p>Output:</p>
<pre><code>q)k)(1+!26)#'.Q.a
,&quot;a&quot;
&quot;bb&quot;
&quot;ccc&quot;
&quot;dddd&quot;
&quot;eeeee&quot;
&quot;ffffff&quot;
&quot;ggggggg&quot;
&quot;hhhhhhhh&quot;
&quot;iiiiiiiii&quot;
&quot;jjjjjjjjjj&quot;
&quot;kkkkkkkkkkk&quot;
&quot;llllllllllll&quot;
&quot;mmmmmmmmmmmmm&quot;
&quot;nnnnnnnnnnnnnn&quot;
&quot;ooooooooooooooo&quot;
&quot;pppppppppppppppp&quot;
&quot;qqqqqqqqqqqqqqqqq&quot;
&quot;rrrrrrrrrrrrrrrrrr&quot;
&quot;sssssssssssssssssss&quot;
&quot;tttttttttttttttttttt&quot;
&quot;uuuuuuuuuuuuuuuuuuuuu&quot;
&quot;vvvvvvvvvvvvvvvvvvvvvv&quot;
&quot;wwwwwwwwwwwwwwwwwwwwwww&quot;
&quot;xxxxxxxxxxxxxxxxxxxxxxxx&quot;
&quot;yyyyyyyyyyyyyyyyyyyyyyyyy&quot;
&quot;zzzzzzzzzzzzzzzzzzzzzzzzzz&quot;
</code></pre>


blocks|key|162446|text|Dart，81字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162447|List.generate(26,(i)=>''.padRight(i%2B1,String.fromCharCode(i%2B97))).forEach(print);|code-block|syntax|javascript|162448|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.dartlang.org/|1|https://tio.run/##S0ksKvlflp@ZopCbmJmnoVn93yezuEQvPTUvtSixJFXDyExHI1PT1k5dXa8gMSUoMz2jRCNT21AnuKQoMy9dL60oP9c5I7HIOT8lFShuaa6pqamXll/kmpicoVEAVFKiaf2/9j8A^0|0|4|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.dartlang.org/" rel="nofollow noreferrer">Dart</a>, 81 bytes</h1>

<pre><code>List.generate(26,(i)=&gt;''.padRight(i+1,String.fromCharCode(i+97))).forEach(print);
</code></pre>

<p><a href="https://tio.run/##S0ksKvlflp@ZopCbmJmnoVn93yezuEQvPTUvtSixJFXDyExHI1PT1k5dXa8gMSUoMz2jRCNT21AnuKQoMy9dL60oP9c5I7HIOT8lFShuaa6pqamXll/kmpicoVEAVFKiaf2/9j8A" rel="nofollow noreferrer" title="Dart – Try It Online">Try it online!</a></p>


blocks|key|1300676|text|摇滚之星，51字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300677|X's0
while+X-26
build+X+up
cast+X%2B96+into+C
say+C*X|code-block|syntax|javascript|1300678|在这里试试+(代码需要粘贴)|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://codewithrockstar.com/|1|https://codewithrockstar.com/online^0|0|4|0|0|0|0|5|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://codewithrockstar.com/" rel="nofollow noreferrer">Rockstar</a>, 51 bytes</h1>
<pre><code>X's0
while X-26
build X up
cast X+96 into C
say C*X
</code></pre>
<p><a href="https://codewithrockstar.com/online" rel="nofollow noreferrer">Try it here</a> (Code will need to be pasted in)</p>


blocks|key|1300708|text|第四次(痛风)，49字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1300709|:+f+26.+do+i+dup+for+dup+97+%2B+emit+next+cr+loop+;|code-block|syntax|javascript|1300710|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://www.complang.tuwien.ac.at/forth/gforth/Docs-html/|1|https://tio.run/##S8svKsnQTU8DUf//WymkKRiZ6Smk5CtkKqSUFigAxcG0pbmCtkJqbmaJQl5qRYlCcpFCTn5@gYL1/7T/AA^0|0|7|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://www.complang.tuwien.ac.at/forth/gforth/Docs-html/" rel="nofollow noreferrer">Forth (gforth)</a>, 49 bytes</h1>

<pre class="lang-forth prettyprint-override"><code>: f 26. do i dup for dup 97 + emit next cr loop ;
</code></pre>
<p><a href="https://tio.run/##S8svKsnQTU8DUf//WymkKRiZ6Smk5CtkKqSUFigAxcG0pbmCtkJqbmaJQl5qRYlCcpFCTn5@gYL1/7T/AA" rel="nofollow noreferrer" title="Forth (gforth) – Try It Online">Try it online!</a></p>


blocks|key|162585|text|Python+2，57字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162586|for+a+in+"abcdefghijklmnosqrstuvwxyz":print+a*(ord(a)-96)|code-block|syntax|javascript|162587|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##K6gsycjPM/r/Py2/SCFRITNPQSkxKTklNS09IzMrOyc3L7@4sKi4pLSsvKKySsmqoCgzr0QhUUsjvyhFI1FT19JM8/9/AA^0|0|8|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://docs.python.org/2/" rel="nofollow noreferrer">Python 2</a>, 57 bytes</h1>

<pre class="lang-python prettyprint-override"><code>for a in &quot;abcdefghijklmnosqrstuvwxyz&quot;:print a*(ord(a)-96)
</code></pre>
<p><a href="https://tio.run/##K6gsycjPM/r/Py2/SCFRITNPQSkxKTklNS09IzMrOyc3L7@4sKi4pLSsvKKySsmqoCgzr0QhUUsjvyhFI1FT19JM8/9/AA" rel="nofollow noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>


blocks|key|162662|text|BQN，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|162663|⥊¨⟜'`'⊸%2B↕27|code-block|syntax|javascript|162664|在线运行！|unstyled|162665|输出一行列表，包括开头的空行。如果这太扭曲规则，下面是一个17字节版本，它输出一个字符串(带有两个前导换行符)。|162666|解释|162667|⥊¨⟜'`'⊸%2B↕27
+++++++++↕27++Range(27)
++++'`'⊸%2B+++++Add+the+`+character+to+each+(0+->+`,+1+->+a,+...,+26+->+z)
⥊¨⟜++++++++++Reshape+each:+Nth+character+->+string+N+characters+long|entityMap|0|LINK|mutability|MUTABLE|url|https://mlochbaum.github.io/BQN/|1|https://mlochbaum.github.io/BQN/try.html#code=4qWKwqjin5wnYCfiirgr4oaVMjc=|2|https://mlochbaum.github.io/BQN/try.html#code=4oi%2BJwon4oi%2BwqjipYrCqOKfnCdgJ%2BKKuCvihpUyNw==^0|0|3|0|0|0|0|5|1|0|T|6|2|0|0^^$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|@$A|1C|B|1D|1|1E]]|C|$]]|$1|N|3|O|5|6|7|1F|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1G|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|T|U|V|C|$W|11]]]]

<h1><a href="https://mlochbaum.github.io/BQN/" rel="nofollow noreferrer">BQN</a>, 11 bytes</h1>
<pre><code>⥊¨⟜'`'⊸+↕27
</code></pre>
<p><a href="https://mlochbaum.github.io/BQN/try.html#code=4qWKwqjin5wnYCfiirgr4oaVMjc=" rel="nofollow noreferrer">Run it online!</a></p>
<p>Outputs a list of lines, including an empty line at the beginning. If that's bending the rules too much, here's a <a href="https://mlochbaum.github.io/BQN/try.html#code=4oi+Jwon4oi+wqjipYrCqOKfnCdgJ+KKuCvihpUyNw==" rel="nofollow noreferrer">17-byte version</a> that outputs a string (with two leading newlines).</p>
<h3>Explanation</h3>
<pre><code>⥊¨⟜'`'⊸+↕27
         ↕27  Range(27)
    '`'⊸+     Add the ` character to each (0 -&gt; `, 1 -&gt; a, ..., 26 -&gt; z)
⥊¨⟜          Reshape each: Nth character -&gt; string N characters long
</code></pre>


blocks|key|162809|text|因子+%2B+spelling，44字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|162810|[+ALPHABET+[+1+%2B+swap+<string>+]+map-index+]|code-block|syntax|javascript|162811|只工作在最近的构建因素，所以有一个截图，而不是TIO链接。|unstyled|162812|📷|atomic|entityMap|0|LINK|mutability|MUTABLE|url|https://factorcode.org/|1|IMAGE|IMMUTABLE|imageUrl|https://i.stack.imgur.com/mB2TO.png|imageAlt^0|5|8|0|2|0|0|0|0|0|1|1^^$0|@$1|2|3|4|5|6|7|13|8|@$9|14|A|15|B|C]]|D|@$9|16|A|17|1|18]]|E|$]]|$1|F|3|G|5|H|7|19|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|1A|8|@]|D|@]|E|$]]|$1|N|3|O|5|P|7|1B|8|@]|D|@$9|1C|A|1D|1|1E]]|E|$]]]|Q|$R|$5|S|T|U|E|$V|W]]|X|$5|Y|T|Z|E|$10|11|12|-4]]]]

<h1><a href="https://factorcode.org/" rel="nofollow noreferrer">Factor</a> + <code>spelling</code>, 44 bytes</h1>
<pre><code>[ ALPHABET [ 1 + swap &lt;string&gt; ] map-index ]
</code></pre>
<p>Only works in recent-ish builds of Factor, so have a screenshot instead of a TIO link.</p>
<p><a href="https://i.stack.imgur.com/mB2TO.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/mB2TO.png" alt="enter image description here" /></a></p>


blocks|key|162995|text|图2，7\log_{256}(96)\approx+5.762字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|162996|*fcaa26|code-block|syntax|javascript|162997|在网上试试！|unstyled|162998|-感谢我的克隆人|162999|*fcaa26+#+Returns+a+list+of+lines,+as+allowed+in+the+comments
+fca++++#+Split+the+letters+of+the+alphabet
*+++++++#+Multiply
++++a26+#+By+the+range+[1,+26]|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Seggan/Fig|1|INLINETEX|IMMUTABLE|teX|7\log_{256}(96)\approx|2|https://fig.fly.dev/#WyIqZmNhYTI2IiwiIl0=^0|3|M|0|2|0|3|M|1|0|0|0|6|2|0|0^^$0|@$1|2|3|4|5|6|7|15|8|@$9|16|A|17|B|C]]|D|@$9|18|A|19|1|1A]|$9|1B|A|1C|1|1D]]|E|$]]|$1|F|3|G|5|H|7|1E|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|1F|8|@]|D|@$9|1G|A|1H|1|1I]]|E|$]]|$1|N|3|O|5|M|7|1J|8|@]|D|@]|E|$]]|$1|P|3|Q|5|H|7|1K|8|@]|D|@]|E|$I|J]]]|R|$S|$5|T|U|V|E|$W|X]]|Y|$5|Z|U|10|E|$11|12]]|13|$5|T|U|V|E|$W|14]]]]

<h1><a href="https://github.com/Seggan/Fig" rel="nofollow noreferrer">Fig</a>, <span class="math-container">\$7\log_{256}(96)\approx\$</span> 5.762 bytes</h1>
<pre><code>*fcaa26
</code></pre>
<p><a href="https://fig.fly.dev/#WyIqZmNhYTI2IiwiIl0=" rel="nofollow noreferrer">Try it online!</a></p>
<p>-2 chars thanks to my clone</p>
<pre><code>*fcaa26 # Returns a list of lines, as allowed in the comments
 fca    # Split the letters of the alphabet
*       # Multiply
    a26 # By the range [1, 26]
</code></pre>


<p><strong>The Challenge</strong></p>
<p>Your task is to create a program or function that outputs the following with no input:</p>
<pre><code>a
bb
ccc
dddd
eeeee
ffffff
ggggggg
hhhhhhhh
iiiiiiiii
jjjjjjjjjj
kkkkkkkkkkk
llllllllllll
mmmmmmmmmmmmm
nnnnnnnnnnnnnn
ooooooooooooooo
pppppppppppppppp
qqqqqqqqqqqqqqqqq
rrrrrrrrrrrrrrrrrr
sssssssssssssssssss
tttttttttttttttttttt
uuuuuuuuuuuuuuuuuuuuu
vvvvvvvvvvvvvvvvvvvvvv
wwwwwwwwwwwwwwwwwwwwwww
xxxxxxxxxxxxxxxxxxxxxxxx
yyyyyyyyyyyyyyyyyyyyyyyyy
zzzzzzzzzzzzzzzzzzzzzzzzzz
</code></pre>
<p>You may use the uppercase alphabet instead of lowercase if you prefer. Trailing/leading newlines or spaces are allowed.</p>
<p><strong>Scoring</strong></p>
<p>This is <a href="/questions/tagged/code-golf" class="post-tag" title="show questions tagged &#39;code-golf&#39;" rel="tag">code-golf</a>, so the shortest answer in each language wins.</p>


Alphabet Staircase

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

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

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

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

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯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上新

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

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

问字母表阶梯
EN

评分

回答 76

Code Golf用户

05AB1E，2字节

在网上试试！

是如何工作的

Code Golf用户

Python 2，36字节

Code Golf用户

脑盘，74字节

解释

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问字母表阶梯EN

评分

回答 76

Code Golf用户

05AB1E，2字节

在网上试试！

是如何工作的

Code Golf用户

Python 2，36字节

Code Golf用户

脑盘，74字节

解释

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问字母表阶梯
EN