blocks|key|1264357|text|Python+3，34字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264358|f=lambda+l:l+and+l[1::-1]%2Bf(l[2:])|code-block|syntax|javascript|1264359|在网上试试！|unstyled|1264360|当l是空的(这使得它是错误的)，直接返回它。否则，反转前两个元素并对其余元素进行递归调用。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##K6gsycjPM/7/P802JzE3KSVRIccqRyExL0UhJ9rQykrXMFY7TSMn2sgqVvN/QVFmXolGmka0oY6RjrGOiY6pjlmspuZ/AA^0|0|8|0|0|0|0|6|1|0|1|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]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

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

<pre class="lang-python prettyprint-override"><code>f=lambda l:l and l[1::-1]+f(l[2:])
</code></pre>
<p><a href="https://tio.run/##K6gsycjPM/7/P802JzE3KSVRIccqRyExL0UhJ9rQykrXMFY7TSMn2sgqVvN/QVFmXolGmka0oY6RjrGOiY6pjlmspuZ/AA" rel="noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>
<p>When <code>l</code> is empty (which makes it falsy), return it directly. Otherwise, reverse the first two elements and make a recursive call for the rest.</p>


blocks|key|1261093|text|维沙尔+r，2字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1261094|yY|code-block|syntax|javascript|1261095|在网上试试！|unstyled|1261096|解释：|1261097|y++#+Uninterleave
+Y+#+Interleave|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://lyxal.pythonanywhere.com/?flags=r&code=yY&inputs=%255B1%252C2%252C3%252C4%252C5%252C6%255D&header=&footer=^0|4|1|0|3|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@$9|11|A|12|B|C]]|D|@$9|13|A|14|1|15]]|E|$]]|$1|F|3|G|5|H|7|16|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|17|8|@]|D|@$9|18|A|19|1|1A]]|E|$]]|$1|N|3|O|5|M|7|1B|8|@]|D|@]|E|$]]|$1|P|3|Q|5|H|7|1C|8|@]|D|@]|E|$I|J]]]|R|$S|$5|T|U|V|E|$W|X]]|Y|$5|T|U|V|E|$W|Z]]]]

<h1><a href="https://github.com/Vyxal/Vyxal" rel="noreferrer">Vyxal</a> <code>r</code>, 2 bytes</h1>
<pre><code>yY
</code></pre>
<p><a href="https://lyxal.pythonanywhere.com?flags=r&amp;code=yY&amp;inputs=%5B1%2C2%2C3%2C4%2C5%2C6%5D&amp;header=&amp;footer=" rel="noreferrer">Try it Online!</a></p>
<p>Explanation:</p>
<pre><code>y  # Uninterleave
 Y # Interleave
</code></pre>


blocks|key|1261919|text|哈斯克尔，22字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1261920|f(a:b:c)=b:a:f+c
f+x=x|code-block|syntax|javascript|1261921|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/##y0gszk7Nyfn/P00j0SrJKlnTNskq0SpNIZkrTaHCtuJ/bmJmnoKtQkq@ApdCQVFmXomCikJatKGenlksioCOgQ4Ux/4HAA^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.haskell.org/" rel="noreferrer">Haskell</a>, 22 bytes</h1>

<pre class="lang-hs prettyprint-override"><code>f(a:b:c)=b:a:f c
f x=x
</code></pre>
<p><a href="https://tio.run/##y0gszk7Nyfn/P00j0SrJKlnTNskq0SpNIZkrTaHCtuJ/bmJmnoKtQkq@ApdCQVFmXomCikJatKGenlksioCOgQ4Ux/4HAA" rel="noreferrer" title="Haskell – Try It Online">Try it online!</a></p>


blocks|key|1264654|text|传话，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264655|我知道我应该实现SpaceChem的触发器操作符，那么这将是5个字节。:-)|unstyled|1264656|-6字节@Manny+Queen|1264657|}?{
}~1|code-block|syntax|javascript|1264658|在网上试试！|1264659|{将输入列表放到传送带上，}打印结果。在?上，如果可以的话，元素就会下降。在~上，它们将在进入输出之前等待1滴答，因此，从第一个条目开始，每个第二个元素都会被延迟两个滴答。|style|CODE|1264660|13字节|1264661|},<
{@%5E
0"
1%5E|1264662|1264663|下循环0"\1%5E将0+1+0+1+…复制到选择@中。因此，输入被分成两条路径。正确的一个需要花费更长的时间，因此其他号码可以在再次加入,之前超过它。|1264664|📷|atomic|entityMap|0|LINK|mutability|MUTABLE|url|http://xn--wxa.land/convey/|1|https://xn--wxa.land/convey/run.html#eyJjIjoifT97XG59fjEiLCJ2IjoxLCJpIjoiMSAyIDMgNCA1IDYifQ==|2|https://xn--wxa.land/convey/run.html#eyJjIjoifSw8XG57QF5cbjBcIlxuMV4iLCJ2IjoxLCJpIjoiMSAyIDMgNCA1IDYifQ==|3|IMAGE|IMMUTABLE|imageUrl|https://i.stack.imgur.com/d4SqQ.gif|imageAlt^0|0|2|0|0|0|0|0|0|6|1|0|0|1|D|1|K|1|12|1|1H|1|0|0|0|0|6|2|0|3|5|9|9|N|1|1V|1|0|0|1|3^^$0|@$1|2|3|4|5|6|7|1K|8|@]|9|@$A|1L|B|1M|1|1N]]|C|$]]|$1|D|3|E|5|F|7|1O|8|@]|9|@]|C|$]]|$1|G|3|H|5|F|7|1P|8|@]|9|@]|C|$]]|$1|I|3|J|5|K|7|1Q|8|@]|9|@]|C|$L|M]]|$1|N|3|O|5|F|7|1R|8|@]|9|@$A|1S|B|1T|1|1U]]|C|$]]|$1|P|3|Q|5|F|7|1V|8|@$A|1W|B|1X|R|S]|$A|1Y|B|1Z|R|S]|$A|20|B|21|R|S]|$A|22|B|23|R|S]|$A|24|B|25|R|S]]|9|@]|C|$]]|$1|T|3|U|5|6|7|26|8|@]|9|@]|C|$]]|$1|V|3|W|5|K|7|27|8|@]|9|@]|C|$L|M]]|$1|X|3|O|5|F|7|28|8|@]|9|@$A|29|B|2A|1|2B]]|C|$]]|$1|Y|3|Z|5|F|7|2C|8|@$A|2D|B|2E|R|S]|$A|2F|B|2G|R|S]|$A|2H|B|2I|R|S]|$A|2J|B|2K|R|S]]|9|@]|C|$]]|$1|10|3|11|5|12|7|2L|8|@]|9|@$A|2M|B|2N|1|2O]]|C|$]]]|13|$14|$5|15|16|17|C|$18|19]]|1A|$5|15|16|17|C|$18|1B]]|1C|$5|15|16|17|C|$18|1D]]|1E|$5|1F|16|1G|C|$1H|1I|1J|-4]]]]

<h1><a href="http://xn--wxa.land/convey/" rel="nofollow noreferrer">convey</a>, 7 bytes</h1>
<p>I knew I should have implemented SpaceChem's flipflop operator, then this would be 5 bytes. :-)</p>
<p><em>-6 byte by @Manny Queen</em></p>
<pre><code>}?{
}~1
</code></pre>
<p><a href="https://xn--wxa.land/convey/run.html#eyJjIjoifT97XG59fjEiLCJ2IjoxLCJpIjoiMSAyIDMgNCA1IDYifQ==" rel="nofollow noreferrer">Try it online!</a></p>
<p><code>{</code> puts the input list on the conveyor, <code>}</code> prints the result. On the <code>?</code> the elements try to go down if they can. On the <code>~</code> they will wait for <code>1</code> tick before going to the output, thus starting with the first item, every second element is delayed for two ticks.</p>
<h3>13 bytes</h3>
<pre><code>},&lt;
{@^
0&quot;
1^
</code></pre>
<p><a href="https://xn--wxa.land/convey/run.html#eyJjIjoifSw8XG57QF5cbjBcIlxuMV4iLCJ2IjoxLCJpIjoiMSAyIDMgNCA1IDYifQ==" rel="nofollow noreferrer">Try it online!</a></p>
<p>The lower loop <code>0&quot;\1^</code> copies <code>0 1 0 1 …</code> into choose <code>@</code>. The input is thus split into two paths. The right one takes a little bit longer, so the other number can overtake it before joining <code>,</code> again.</p>
<p><a href="https://i.stack.imgur.com/d4SqQ.gif" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/d4SqQ.gif" alt="variant 2 with input 1 to 6" /></a></p>


blocks|key|1261943|text|脑盘，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1261944|,[>,.<.,]|code-block|syntax|javascript|1261945|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/TryItOnline/brainfuck|1|https://tio.run/##SypKzMxLK03O/v9fJ9pOR89GTyf2/39DI2MTUzMA^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/TryItOnline/brainfuck" rel="noreferrer">brainfuck</a>, 9 bytes</h1>
<pre><code>,[&gt;,.&lt;.,]
</code></pre>
<p><a href="https://tio.run/##SypKzMxLK03O/v9fJ9pOR89GTyf2/39DI2MTUzMA" rel="noreferrer" title="brainfuck – Try It Online">Try it online!</a></p>


blocks|key|1262358|text|Python+2，30字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1262359|def+f(a,b,*m):print+b,a,;f(*m)|code-block|syntax|javascript|1262360|在网上试试！|unstyled|1262361|函数f接受像f(1,2,3,4,5,6)一样的输入，并打印输出空间-分隔的，结束与错误。|style|CODE|1262362|34字节|1262363|lambda+l:map(l.pop,len(l)/2*[1,0])|1262364|1262365|这是通过交替弹出索引1和索引0中的元素来实现的。|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##HYs7DsMgEAV7TrElWK8IzqcgtW@QznJhJ4uMlGCENrI5PUEpphnNpCLrFvtaX@zJ6xkLuo9xKYcotGDG3esm6r6GN5N1iiQX18ouxPQVbYwiPp6chB4l8ZDzlh399zpa9DjjgitukxpPsGhMPw|2|https://tio.run/##DcpLCoAgEADQfadwqTGU2mchdJJyYVQojDaEEZ3eWr9Hb/Zn0uWYloIurptjaKIjjg2dBLgnjqLV9axAWlEeH3BnytAVUmYHD4nuzIUov2vooIcBRlvNEv4Pyn4^0|0|8|0|0|0|0|6|1|0|2|1|6|E|0|0|0|0|6|2|0|A|1|E|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|@$A|1H|B|1I|N|O]|$A|1J|B|1K|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|6|7|1L|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1M|8|@]|9|@]|C|$G|H]]|$1|T|3|J|5|K|7|1N|8|@]|9|@$A|1O|B|1P|1|1Q]]|C|$]]|$1|U|3|V|5|K|7|1R|8|@$A|1S|B|1T|N|O]|$A|1U|B|1V|N|O]]|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]]]]

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

<pre class="lang-python prettyprint-override"><code>def f(a,b,*m):print b,a,;f(*m)
</code></pre>
<p><a href="https://tio.run/##HYs7DsMgEAV7TrElWK8IzqcgtW@QznJhJ4uMlGCENrI5PUEpphnNpCLrFvtaX@zJ6xkLuo9xKYcotGDG3esm6r6GN5N1iiQX18ouxPQVbYwiPp6chB4l8ZDzlh399zpa9DjjgitukxpPsGhMPw" rel="noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>
<p>The function <code>f</code> takes input splatted like <code>f(1,2,3,4,5,6)</code>, and prints the output space-separated, terminating with error.</p>
<hr />
<p><strong>34 bytes</strong></p>

<pre class="lang-python prettyprint-override"><code>lambda l:map(l.pop,len(l)/2*[1,0])
</code></pre>
<p><a href="https://tio.run/##DcpLCoAgEADQfadwqTGU2mchdJJyYVQojDaEEZ3eWr9Hb/Zn0uWYloIurptjaKIjjg2dBLgnjqLV9axAWlEeH3BnytAVUmYHD4nuzIUov2vooIcBRlvNEv4Pyn4" rel="noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>
<p>This works by alternating popping the elements at index <code>1</code> and index <code>0</code>.</p>


blocks|key|1264978|text|Wolfram语言(数学)，22字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264979|0<##<1%7C%7C#2&&#&�@##3&|code-block|syntax|javascript|1264980|在网上试试！|unstyled|1264981|输入[L...]，并在And中返回。适用于整数输入。|style|CODE|1264982|Wolfram语言(数学)，24字节|1264983|{}=={##}%7C%7C#2&&#&�@##3&|1264984|1264985|输入[L...]，并在And中返回。工作在非布尔输入。|1264986|Wolfram语言(数学)，26字节|1264987|#2~##&~#&@@@#~Partition~2&|1264988|1264989|输入[L]，并返回一个列表。很管用。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.wolfram.com/wolframscript/|1|https://tio.run/##y00syUjNTSzJTE78n2b738BGWdnGsKZG2UhNTRmIDByUlY3V/geWZqaWOAQUZeaVRCvr2qU5OCjHqtUFJyfm1VVzVRvqGOkY65jomOqY1epwVRvoGOoAMYRpUMtV@x8A|2|3|https://tio.run/##y00syUjNTSzJTE78n2b7v7rW1rZaWbm2pkbZSE1NGYgMHJSVjdX@B5ZmppY4BBRl5pVEK@vapTk4KMeq1QUnJ@bVVXNVG@oY6RjrmOiY6pjV6nBVG@gY6gAxhGlQy1X7HwA|4|5|https://tio.run/##DcM7CoAwDADQvdcIdIqg9bMpOULBURxCUexgBclWmqtXH7yb5Tpulhi4nnMFpwBWwRIRqOdXosQnqbPVvzHJBs1yEuxW18BJs8kdOuxxwBGngia32OG/mFI/^0|0|D|0|0|0|0|6|1|0|2|6|B|3|0|0|D|2|0|0|0|6|3|0|2|6|B|3|0|0|D|4|0|0|0|6|5|0|2|3^^$0|@$1|2|3|4|5|6|7|1I|8|@]|9|@$A|1J|B|1K|1|1L]]|C|$]]|$1|D|3|E|5|F|7|1M|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1N|8|@]|9|@$A|1O|B|1P|1|1Q]]|C|$]]|$1|L|3|M|5|K|7|1R|8|@$A|1S|B|1T|N|O]|$A|1U|B|1V|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|6|7|1W|8|@]|9|@$A|1X|B|1Y|1|1Z]]|C|$]]|$1|R|3|S|5|F|7|20|8|@]|9|@]|C|$G|H]]|$1|T|3|J|5|K|7|21|8|@]|9|@$A|22|B|23|1|24]]|C|$]]|$1|U|3|V|5|K|7|25|8|@$A|26|B|27|N|O]|$A|28|B|29|N|O]]|9|@]|C|$]]|$1|W|3|X|5|6|7|2A|8|@]|9|@$A|2B|B|2C|1|2D]]|C|$]]|$1|Y|3|Z|5|F|7|2E|8|@]|9|@]|C|$G|H]]|$1|10|3|J|5|K|7|2F|8|@]|9|@$A|2G|B|2H|1|2I]]|C|$]]|$1|11|3|12|5|K|7|2J|8|@$A|2K|B|2L|N|O]]|9|@]|C|$]]]|13|$14|$5|15|16|17|C|$18|19]]|1A|$5|15|16|17|C|$18|1B]]|1C|$5|15|16|17|C|$18|19]]|1D|$5|15|16|17|C|$18|1E]]|1F|$5|15|16|17|C|$18|19]]|1G|$5|15|16|17|C|$18|1H]]]]

<h1><a href="https://www.wolfram.com/wolframscript/" rel="nofollow noreferrer">Wolfram Language (Mathematica)</a>, 22 bytes</h1>
<pre><code>0&lt;##&lt;1||#2&amp;&amp;#&amp;&amp;#0@##3&amp;
</code></pre>
<p><a href="https://tio.run/##y00syUjNTSzJTE78n2b738BGWdnGsKZG2UhNTRmIDByUlY3V/geWZqaWOAQUZeaVRCvr2qU5OCjHqtUFJyfm1VVzVRvqGOkY65jomOqY1epwVRvoGOoAMYRpUMtV@x8A" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>
<p>Input <code>[L...]</code>, and returns in an <code>And</code>. Works on integer inputs.</p>
<hr />
<h3><a href="https://www.wolfram.com/wolframscript/" rel="nofollow noreferrer">Wolfram Language (Mathematica)</a>, 24 bytes</h3>
<pre><code>{}=={##}||#2&amp;&amp;#&amp;&amp;#0@##3&amp;
</code></pre>
<p><a href="https://tio.run/##y00syUjNTSzJTE78n2b7v7rW1rZaWbm2pkbZSE1NGYgMHJSVjdX@B5ZmppY4BBRl5pVEK@vapTk4KMeq1QUnJ@bVVXNVG@oY6RjrmOiY6pjV6nBVG@gY6gAxhGlQy1X7HwA" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>
<p>Input <code>[L...]</code>, and returns in an <code>And</code>. Works on non-boolean inputs.</p>
<h3><a href="https://www.wolfram.com/wolframscript/" rel="nofollow noreferrer">Wolfram Language (Mathematica)</a>, 26 bytes</h3>
<pre><code>#2~##&amp;~#&amp;@@@#~Partition~2&amp;
</code></pre>
<p><a href="https://tio.run/##DcM7CoAwDADQvdcIdIqg9bMpOULBURxCUexgBclWmqtXH7yb5Tpulhi4nnMFpwBWwRIRqOdXosQnqbPVvzHJBs1yEuxW18BJs8kdOuxxwBGngia32OG/mFI/" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>
<p>Input <code>[L]</code>, and returns a list. Works.</p>


blocks|key|1261337|text|JavaScript+(ES6)，23字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1261338|x=>x.map((_,i)=>x[i%5E1])|code-block|syntax|javascript|1261339|[i%5E1]多亏了TNB中的m90|unstyled|offset|length|style|CODE|1261340|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##y0osSyxOLsosKNHNy09J/Z@TWqJQXJ5YUGz7P9HWLlEvN7FAQyNeJ1MTyInOjDOM1QQrycwrKC1RsFWINtQx0jHWMdEx1TGLteZKzs8rzs9J1cvJT9dIUKkGq6pV0LVTUKkGG6oBFtGsTdC0/g8A^0|0|0|0|5|0|0|6|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@$J|Z|K|10|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|11|8|@]|9|@$J|12|K|13|1|14]]|A|$]]]|P|$Q|$5|R|S|T|A|$U|V]]]]

<h1>JavaScript (ES6), 23 bytes</h1>
<pre><code>x=&gt;x.map((_,i)=&gt;x[i^1])
</code></pre>
<p>The <code>[i^1]</code> is thanks to m90 in TNB</p>
<p><a href="https://tio.run/##y0osSyxOLsosKNHNy09J/Z@TWqJQXJ5YUGz7P9HWLlEvN7FAQyNeJ1MTyInOjDOM1QQrycwrKC1RsFWINtQx0jHWMdEx1TGLteZKzs8rzs9J1cvJT9dIUKkGq6pV0LVTUKkGG6oBFtGsTdC0/g8A" rel="noreferrer">Try it online!</a></p>


blocks|key|1264148|text|Python+3，36字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264149|lambda+a:sum(zip(a[1::2],a[::2]),())|code-block|syntax|javascript|1264150|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##K6gsycjPM/6fZhvzPycxNyklUSHRqrg0V6Mqs0AjMdrQysooVicxGkRp6mhoav4vKMrMK9FI04g21DHSMdYx0THVMYsFigMA^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/3/" rel="noreferrer">Python 3</a>, 36 bytes</h1>

<pre class="lang-python prettyprint-override"><code>lambda a:sum(zip(a[1::2],a[::2]),())
</code></pre>
<p><a href="https://tio.run/##K6gsycjPM/6fZhvzPycxNyklUSHRqrg0V6Mqs0AjMdrQysooVicxGkRp6mhoav4vKMrMK9FI04g21DHSMdYx0THVMYsFigMA" rel="noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>


blocks|key|1262003|text|Python+3+%2B+numpy，31字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1262004|lambda+m:m[~-(m==m).cumsum()%5E1]|code-block|syntax|javascript|1262005|在网上试试！|unstyled|1262006|期望有一个数字数组。大多数代码都是关于避免直接引用numpy的，因此我们可以避免显式导入。然后，它通过使用1连接计数器来直接计算索引。|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##XcqxDoIwEADQna/oeJecREQdNP0SwOTAEEm841LaoQu/Xp0Z3vYsx8@qbZl9X74s45udPKTbTyDeC9ZTki0J4KsZyiK2hug0iWXHm1OrKvZqNYfAGbqGLtTSlW50H/BpYdEITDMw4uGd6e94yg8^0|0|8|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://docs.python.org/3/" rel="noreferrer">Python 3</a> + numpy, 31 bytes</h1>

<pre class="lang-python prettyprint-override"><code>lambda m:m[~-(m==m).cumsum()^1]
</code></pre>
<p><a href="https://tio.run/##XcqxDoIwEADQna/oeJecREQdNP0SwOTAEEm841LaoQu/Xp0Z3vYsx8@qbZl9X74s45udPKTbTyDeC9ZTki0J4KsZyiK2hug0iWXHm1OrKvZqNYfAGbqGLtTSlW50H/BpYdEITDMw4uGd6e94yg8" rel="noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>
<p>Expects a numpy array. Most of the code is about avoiding referencing numpy directly, so we can avoid the explicit import. It then calculates the indices directly by xoring a counter with 1.</p>


blocks|key|1265856|text|莱伊，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1265857|ir[foo]|code-block|syntax|javascript|1265858|在网上试试！|unstyled|1265859|相当直截了当，但可能值得张贴，因为它几乎是可宣布的。:)|1265860|ir+++++++--+read+input+codepoints+into+the+stack,+reverse+the+order
++[+++]++--+while+the+stack+isn't+empty
+++foo+++--+flip+the+top+two+entries+and+print+as+characters|1265861|Cubix，14字节|1265862|..@.i?i.o;o;.%5E|1265863|1265864|这是我第一次尝试使用Cubix，所以如果可以使用更少的代码，我就不会被告知。这是一种很难解释的语言，因为它是一种2D语言，代码被包装在一个立方体上。因此，指令指针的方向很难在描述中显示。我将包含一个指向在线解释器的链接，因为它具有调试模式，当您看到代码遍历单元格的方式时。|1265865|但我也会解释的..。|1265866|..@.i?i.o;o;.%5E+-+code+before+it's+wrapped+on+the+cube...
++++i++++++++++-+(1)+starts+here,+input+a+codepoint
+++++?+++++++++-+branch+if+top+of+stack,+<0+"left",+>0+"right"
++@++++++++++++-+"left"+(true+on+EOF),+halt+program
+++++++++++++%5E+-+"right",+set+IP+direction+to+"up"
+++++?+++++++++-+same+branch,+but+coming+from+another+direction
++++++i++++++++-+"right",+input+another+codepoint
++++++++o;+++++-+output+top+of+stack+as+char,+pop+it+off+stack
++++++++++o;+++-+repeat...+code+wraps+back+to+(1)|1265867|.字符是不操作的，需要将其他字符放置在正确的位置，这样它们就可以在多维数据集上正确地排列。|style|CODE|1265868|这里有一个指向在线解释器http://ethproductions.github.io/cubix/?code=Li5ALmk/aS5vO287Ll4=&input=MTIzNDU2Nzg=&speed=20的链接|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/LyricLy/Ly|1|https://tio.run/##y6n8/z@zKDotPz/2/39DI2MTUzNzCwA|2|https://github.com/ETHproductions/cubix|3|https://tio.run/##Sy5Nyqz4/19Pz0Ev0z5TL98631ov7v9/QyNjE1MzcwsA|4|http://ethproductions.github.io/cubix/?code=Li5ALmk/aS5vO287Ll4=&input=MTIzNDU2Nzg=&speed=20^0|0|2|0|0|0|0|6|1|0|0|0|0|5|2|0|0|0|6|3|0|0|0|0|0|1|0|C|2K|4^^$0|@$1|2|3|4|5|6|7|1L|8|@]|9|@$A|1M|B|1N|1|1O]]|C|$]]|$1|D|3|E|5|F|7|1P|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1Q|8|@]|9|@$A|1R|B|1S|1|1T]]|C|$]]|$1|L|3|M|5|K|7|1U|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1V|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|6|7|1W|8|@]|9|@$A|1X|B|1Y|1|1Z]]|C|$]]|$1|R|3|S|5|F|7|20|8|@]|9|@]|C|$G|H]]|$1|T|3|J|5|K|7|21|8|@]|9|@$A|22|B|23|1|24]]|C|$]]|$1|U|3|V|5|K|7|25|8|@]|9|@]|C|$]]|$1|W|3|X|5|K|7|26|8|@]|9|@]|C|$]]|$1|Y|3|Z|5|F|7|27|8|@]|9|@]|C|$G|H]]|$1|10|3|11|5|K|7|28|8|@$A|29|B|2A|12|13]]|9|@]|C|$]]|$1|14|3|15|5|K|7|2B|8|@]|9|@$A|2C|B|2D|1|2E]]|C|$]]]|16|$17|$5|18|19|1A|C|$1B|1C]]|1D|$5|18|19|1A|C|$1B|1E]]|1F|$5|18|19|1A|C|$1B|1G]]|1H|$5|18|19|1A|C|$1B|1I]]|1J|$5|18|19|1A|C|$1B|1K]]]]

<h1><a href="https://github.com/LyricLy/Ly" rel="nofollow noreferrer">Ly</a>, 7 bytes</h1>
<pre><code>ir[foo]
</code></pre>
<p><a href="https://tio.run/##y6n8/z@zKDotPz/2/39DI2MTUzNzCwA" rel="nofollow noreferrer" title="Ly – Try It Online">Try it online!</a></p>
<p>Pretty straightforward, but might be worth posting since it's almost pronounceable. :)</p>
<pre><code>ir       -- read input codepoints into the stack, reverse the order
  [   ]  -- while the stack isn't empty
   foo   -- flip the top two entries and print as characters
</code></pre>
<h1><a href="https://github.com/ETHproductions/cubix" rel="nofollow noreferrer">Cubix</a>, 14 bytes</h1>
<pre><code>..@.i?i.o;o;.^
</code></pre>
<p><a href="https://tio.run/##Sy5Nyqz4/19Pz0Ev0z5TL98631ov7v9/QyNjE1MzcwsA" rel="nofollow noreferrer" title="Cubix – Try It Online">Try it online!</a></p>
<p>This is the first time I've tried to use Cubix, so I wouldn't be suprised if it's possible to do this with less code.  It's a hard language to explain, since it's a 2D language where the code is wrapped around a cube.  So the directions the instruction pointer take a hard to show in a description.  I'll include a link to the online interpreter since it has a debug mode when you can see the way the code iterates through the cells.</p>
<p>But I'll try to explain it too...</p>
<pre><code>..@.i?i.o;o;.^ - code before it's wrapped on the cube...
    i          - (1) starts here, input a codepoint
     ?         - branch if top of stack, &lt;0 &quot;left&quot;, &gt;0 &quot;right&quot;
  @            - &quot;left&quot; (true on EOF), halt program
             ^ - &quot;right&quot;, set IP direction to &quot;up&quot;
     ?         - same branch, but coming from another direction
      i        - &quot;right&quot;, input another codepoint
        o;     - output top of stack as char, pop it off stack
          o;   - repeat... code wraps back to (1)
</code></pre>
<p>The <code>.</code> characters are no-ops and are needed to place the other characters in the right position so they will wrap into place on the cube.</p>
<p>Here's a link to the online interpreter
<a href="http://ethproductions.github.io/cubix/?code=Li5ALmk/aS5vO287Ll4=&amp;input=MTIzNDU2Nzg=&amp;speed=20" rel="nofollow noreferrer">http://ethproductions.github.io/cubix/?code=Li5ALmk/aS5vO287Ll4=&amp;input=MTIzNDU2Nzg=&amp;speed=20</a></p>


blocks|key|1262513|text|红宝石，26字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1262514|->l{r=-1;l.map{l[1%5Er%2B=1]}}|code-block|syntax|javascript|1262515|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.ruby-lang.org/|1|https://tio.run/##KypNqvyfZvtf1y6nushW19A6Ry83saA6J9owrkjb1jC2tvZ/gUJadLShjpGOsY6JjqmOWWzsfwA^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://www.ruby-lang.org/" rel="nofollow noreferrer">Ruby</a>, 26 bytes</h1>

<pre class="lang-ruby prettyprint-override"><code>-&gt;l{r=-1;l.map{l[1^r+=1]}}
</code></pre>
<p><a href="https://tio.run/##KypNqvyfZvtf1y6nushW19A6Ry83saA6J9owrkjb1jC2tvZ/gUJadLShjpGOsY6JjqmOWWzsfwA" rel="nofollow noreferrer" title="Ruby – Try It Online">Try it online!</a></p>


blocks|key|1263314|text|J，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1263315|[:,_2%7C.\]|code-block|syntax|javascript|1263316|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://jsoftware.com/|1|https://tio.run/##y/qvpKeepmBrpaCuoKNgoGAFxLp6Cs5BPm7/o6104o1q9GJi/2tyKXClJmfkK6QpGCoYKRgrmCiYKpj9BwA^0|0|1|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://jsoftware.com/" rel="nofollow noreferrer">J</a>, 9 bytes</h1>
<pre><code>[:,_2|.\]
</code></pre>
<p><a href="https://tio.run/##y/qvpKeepmBrpaCuoKNgoGAFxLp6Cs5BPm7/o6104o1q9GJi/2tyKXClJmfkK6QpGCoYKRgrmCiYKpj9BwA" rel="nofollow noreferrer" title="J – Try It Online">Try it online!</a></p>


blocks|key|1266456|text|T，32字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1266457|输入是一个表变量。|unstyled|1266458|SELECT+a+FROM+@+ORDER+BY+b%2Bb%252*2|code-block|syntax|javascript|1266459|在网上试试|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://data.stackexchange.com/stackoverflow/query/1511250/swap-every-two-elements-in-a-list^0|0|0|0|0|5|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|W|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|6|7|X|8|@]|9|@$L|Y|M|Z|1|10]]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

<h1>T-SQL, 32 bytes</h1>
<p>Input is a table variable</p>
<pre class="lang-sql prettyprint-override"><code>SELECT a FROM @ ORDER BY b+b%2*2
</code></pre>
<p><strong><a href="https://data.stackexchange.com/stackoverflow/query/1511250/swap-every-two-elements-in-a-list" rel="nofollow noreferrer">Try it online</a></strong></p>


blocks|key|1263449|text|4.，22字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1263450|3.72082072152152072094|code-block|syntax|javascript|1263451|在网上试试！|unstyled|1263452|可读性%2B解释：|1263453|3.+720+820+721+521+520+720+9+4
%5E%5E------------------------------+mandatory+prefix
+++%5E%5E%5E--------------------------+initial+input+in+cell+20
+++++++%5E%5E%5E-----------------%5E----+loop+while+cell+20+is+nonzero
+++++++++++%5E%5E%5E------------------+input+to+cell+21
+++++++++++++++%5E%5E%5E--------------+output+cell+21
+++++++++++++++++++%5E%5E%5E----------+output+cell+20
+++++++++++++++++++++++%5E%5E%5E------+input+to+cell+20
+++++++++++++++++++++++++++%5E----+end+loop
+++++++++++++++++++++++++++++%5E--+exit|1263454|相应的四分程序：|1263455|decl+a,+b
input+a
loop+a
++input+b
++print+b
++print+a
++input+a
end|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/urielieli/py-four|1|https://tio.run/##M/n/31jP3MjAwsjA3MjQFISADANLk///DY2MTUzNAA|2|https://esolangs.org/wiki/User:Conor_O%2527Brien/Compilers/Quartic^0|0|2|0|0|0|0|6|1|0|0|0|3|2|2|0^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|L|3|M|5|K|7|1D|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1E|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|1F|8|@]|9|@$A|1G|B|1H|1|1I]]|C|$]]|$1|R|3|S|5|F|7|1J|8|@]|9|@]|C|$G|H]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]|12|$5|V|W|X|C|$Y|13]]]]

<h1><a href="https://github.com/urielieli/py-four" rel="nofollow noreferrer">4</a>, 22 bytes</h1>
<pre><code>3.72082072152152072094
</code></pre>
<p><a href="https://tio.run/##M/n/31jP3MjAwsjA3MjQFISADANLk///DY2MTUzNAA" rel="nofollow noreferrer" title="4 – Try It Online">Try it online!</a></p>
<p>Readable + explanation:</p>
<pre><code>3. 720 820 721 521 520 720 9 4
^^------------------------------ mandatory prefix
   ^^^-------------------------- initial input in cell 20
       ^^^-----------------^---- loop while cell 20 is nonzero
           ^^^------------------ input to cell 21
               ^^^-------------- output cell 21
                   ^^^---------- output cell 20
                       ^^^------ input to cell 20
                           ^---- end loop
                             ^-- exit
</code></pre>
<p>Corresponding <a href="https://esolangs.org/wiki/User:Conor_O%27Brien/Compilers/Quartic" rel="nofollow noreferrer">Quartic</a> program:</p>
<pre><code>decl a, b
input a
loop a
  input b
  print b
  print a
  input a
end
</code></pre>


blocks|key|1260447|text|果冻，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1260448|s2UF|code-block|syntax|javascript|1260449|在网上试试！|unstyled|1260450|s2++++Slices+of+length+2
++U+++Reverse+each
+++F++Flatten|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jellylanguage|1|https://jht.hyper-neutrino.xyz/tio#WyIiLCJzMlVGIiwiIiwiIixbIjEsMiwzLDQsNSw2Il1d^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/DennisMitchell/jellylanguage" rel="nofollow noreferrer">Jelly</a>, 4 bytes</h1>
<pre><code>s2UF
</code></pre>
<p><a href="https://jht.hyper-neutrino.xyz/tio#WyIiLCJzMlVGIiwiIiwiIixbIjEsMiwzLDQsNSw2Il1d" rel="nofollow noreferrer">Try It Online!</a></p>
<pre><code>s2    Slices of length 2
  U   Reverse each
   F  Flatten
</code></pre>


blocks|key|1264176|text|Add%2B%2B，57字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264177|a:?
b:0
n:0
m:3
`b
Ea,Ib=n,,b:1,,x:i,%2B1,Ib=m,,b:0,,Oi,,Ox|code-block|syntax|javascript|1264178|在网上试试！|unstyled|1264179|输入是第一个参数。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/cairdcoinheringaahing/AddPlusPlus|1|https://tio.run/##S0xJKSj4/z/Ryp4rycqAKw@Ic62MuRKSuFwTdTyTbPN0dJKsDHV0KqwydbQNQSK5IBEDHR3/TCCu@P//f7ShjpGOsY6JjqmOWSwA^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/cairdcoinheringaahing/AddPlusPlus" rel="nofollow noreferrer">Add++</a>, 57 bytes</h1>
<pre><code>a:?
b:0
n:0
m:3
`b
Ea,Ib=n,,b:1,,x:i,+1,Ib=m,,b:0,,Oi,,Ox
</code></pre>
<p><a href="https://tio.run/##S0xJKSj4/z/Ryp4rycqAKw@Ic62MuRKSuFwTdTyTbPN0dJKsDHV0KqwydbQNQSK5IBEDHR3/TCCu@P//f7ShjpGOsY6JjqmOWSwA" rel="nofollow noreferrer" title="Add++ – Try It Online">Try it online!</a></p>
<p>Input is the first argument.</p>


blocks|key|1264386|text|APL%2BWIN，17字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1264387|向量提示|unstyled|1264388|,⌽((.5×⍴r),2)⍴r←⎕|code-block|syntax|javascript|1264389|在网上试试！感谢Dyalog经典|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##SyzI0U2pTMzJT9dNzkksLs5M/v@ob6qvz6O2CcZcQJanP5BlyPWooz3tv86jnr0aGnqmh6c/6t1SpKljpAmigfJAdf@BKrj@p3EZKhgpGCuYKJgqmHGlcRkoGCoAMRcXAA^0|0|0|0|0|G|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|W|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|X|8|@]|9|@$L|Y|M|Z|1|10]]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

<h1>APL+WIN, 17 bytes</h1>
<p>Prompts for vector</p>
<pre><code>,⌽((.5×⍴r),2)⍴r←⎕
</code></pre>
<p><a href="https://tio.run/##SyzI0U2pTMzJT9dNzkksLs5M/v@ob6qvz6O2CcZcQJanP5BlyPWooz3tv86jnr0aGnqmh6c/6t1SpKljpAmigfJAdf@BKrj@p3EZKhgpGCuYKJgqmHGlcRkoGCoAMRcXAA" rel="nofollow noreferrer" title="APL (Dyalog Classic) – Try It Online">Try it online! Thanks to Dyalog Classic</a></p>


blocks|key|1265345|text|摇滚之星，98字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1265346|Listen+to+B
cut+B+with+","
I+is+0
while+I+is+less+than+B
shout+B+at+I%2B1
shout+B+at+I
Build+I+up+up|code-block|syntax|javascript|1265347|在网上试试！|unstyled|1265348|1265349|(必须手动复制粘贴代码)|1265350|将输入作为逗号分隔的数字字符串，例如：|1265351|1,2,3,4,5,6|1265352|输出为换行符分隔的数字字符串，如：|1265353|2
1
4
3
6
5|1265354|Rockstar没有模块化，也没有位运算符，因此移植其他解决方案是不可能的。|1265355|解释|1265356|Listen+to+B+++++++++++++;+Read+input+to+B
cut+B+with+","++++++++++;+Split+B+on+","
I+is+0++++++++++++++++++;+Set+I+to+0
while+I+is+less+than+B++;+While+I+<+B.length
++++++++++++++++++++++++;+(Rockstar+Arrays+automatically+coerce+to+length+when+used+as+a+scalar)
shout+B+at+I%2B1++++++++++;+Print+B[I%2B1]+with+trailing+newline
shout+B+at+I++++++++++++;+Print+B[I]+with+trailing+newline
Build+I+up+up+++++++++++;+Increment+I+twice+(each+'up'+increments)|entityMap|0|LINK|mutability|MUTABLE|url|https://codewithrockstar.com/|1|https://codewithrockstar.com/online^0|0|4|0|0|0|0|6|1|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|D|3|E|5|F|7|1F|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1G|8|@]|9|@$A|1H|B|1I|1|1J]]|C|$]]|$1|L|3|-4|5|K|7|1K|8|@]|9|@]|C|$]]|$1|M|3|N|5|K|7|1L|8|@]|9|@]|C|$]]|$1|O|3|P|5|K|7|1M|8|@]|9|@]|C|$]]|$1|Q|3|R|5|F|7|1N|8|@]|9|@]|C|$G|H]]|$1|S|3|T|5|K|7|1O|8|@]|9|@]|C|$]]|$1|U|3|V|5|F|7|1P|8|@]|9|@]|C|$G|H]]|$1|W|3|X|5|K|7|1Q|8|@]|9|@]|C|$]]|$1|Y|3|Z|5|6|7|1R|8|@]|9|@]|C|$]]|$1|10|3|11|5|F|7|1S|8|@]|9|@]|C|$G|H]]]|12|$13|$5|14|15|16|C|$17|18]]|19|$5|14|15|16|C|$17|1A]]]]

<h1><a href="https://codewithrockstar.com/" rel="nofollow noreferrer">Rockstar</a>, 98 bytes</h1>
<pre><code>Listen to B
cut B with &quot;,&quot;
I is 0
while I is less than B
shout B at I+1
shout B at I
Build I up up
</code></pre>
<p><a href="https://codewithrockstar.com/online" rel="nofollow noreferrer">Try it online!</a><br />
(Must manually copy-paste code)</p>
<p>Takes input as comma-separated string of numbers eg:</p>
<pre><code>1,2,3,4,5,6
</code></pre>
<p>Outputs as newline-separated string of numbers eg:</p>
<pre><code>2
1
4
3
6
5
</code></pre>
<p>Rockstar has no modulo, and no bitwise operators, so porting the other solutions is out of the question.</p>
<h3>Explanation</h3>
<pre><code>Listen to B             ; Read input to B
cut B with &quot;,&quot;          ; Split B on &quot;,&quot;
I is 0                  ; Set I to 0
while I is less than B  ; While I &lt; B.length
                        ; (Rockstar Arrays automatically coerce to length when used as a scalar)
shout B at I+1          ; Print B[I+1] with trailing newline
shout B at I            ; Print B[I] with trailing newline
Build I up up           ; Increment I twice (each 'up' increments)
</code></pre>


blocks|key|1261794|text|Python3.8+(预发行版)，35字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1261795|def+f(m):*m[1:],_,m[::2]=*m,m[1::2]|code-block|syntax|javascript|1261796|在网上试试！|unstyled|1261797|就位。本质上是m[1::2],m[::2]=m[::2],m[1::2]的黄金版本|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3.8/|1|https://tio.run/##K6gsycjPM7YoKPr/PyU1TSFNI1fTSis32tAqVideJzfaysoo1lYrVwckAmT@T7SNNtQx0jHWMdEx1TGLtS4oyswr0UjUtE4DETAeF1iZgQ4Q41LyHwA^0|0|G|0|0|0|0|6|1|0|7|T^^$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://docs.python.org/3.8/" rel="nofollow noreferrer">Python 3.8 (pre-release)</a>, 35 bytes</h1>

<pre class="lang-python prettyprint-override"><code>def f(m):*m[1:],_,m[::2]=*m,m[1::2]
</code></pre>
<p><a href="https://tio.run/##K6gsycjPM7YoKPr/PyU1TSFNI1fTSis32tAqVideJzfaysoo1lYrVwckAmT@T7SNNtQx0jHWMdEx1TGLtS4oyswr0UjUtE4DETAeF1iZgQ4Q41LyHwA" rel="nofollow noreferrer" title="Python 3.8 (pre-release) – Try It Online">Try it online!</a></p>
<p>In-place. Essentially a golfed version of <code>m[1::2],m[::2]=m[::2],m[1::2]</code></p>


blocks|key|1265954|text|R，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1265955|function(l)l[seq(!l)%2B2*1:0-1]|code-block|syntax|javascript|1265956|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.r-project.org/|1|https://tio.run/##K/qfpmCj@z@tNC@5JDM/TyNHMye6OLVQQzFHU9tIy9DKQNcw9n@ahqGVmeZ/AA^0|0|1|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.r-project.org/" rel="nofollow noreferrer">R</a>, 29 bytes</h1>

<pre class="lang-r prettyprint-override"><code>function(l)l[seq(!l)+2*1:0-1]
</code></pre>
<p><a href="https://tio.run/##K/qfpmCj@z@tNC@5JDM/TyNHMye6OLVQQzFHU9tIy9DKQNcw9n@ahqGVmeZ/AA" rel="nofollow noreferrer" title="R – Try It Online">Try it online!</a></p>


blocks|key|1262746|text|红色，37字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1262747|func[a][foreach[b+c]a[print[c+lf+b]]]|code-block|syntax|javascript|1262748|在网上试试！|unstyled|1262749|替代|1262750|使用parse的方法要长得多，但更有趣：|style|CODE|1262751|红色，59字节|1262752|func[a][parse+a[collect[any[b:+skip+keep+skip+keep(b/1)]]]]|1262753|entityMap|0|LINK|mutability|MUTABLE|url|http://www.red-lang.org/|1|https://tio.run/##BcG5DYAwEATAnCq2Bd6AMkhXG5izTyAhgyyo/5hpJcdWMqjOV4R/1ZhEv1tJdnCHKfFpZ31puBy7pHCwx4ARE2Ysih8|2|3|https://tio.run/##dcg7DkBAFEbh3ir@kkq8xTK0N7eYx51ECJNBYfVDp@FUJ18QG0exIE7cgOjO1ZBi8irsAkVmWxYxB6n1Ij1gnyePWcS/l@q8yPgp@rBpgQMVKFGhRoOWky9F9@foOd4^0|0|2|0|0|0|0|6|1|0|0|2|5|0|0|2|2|0|0|0|6|3^^$0|@$1|2|3|4|5|6|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]|$1|D|3|E|5|F|7|1C|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|L|3|M|5|6|7|1H|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1I|8|@$A|1J|B|1K|P|Q]]|9|@]|C|$]]|$1|R|3|S|5|6|7|1L|8|@]|9|@$A|1M|B|1N|1|1O]]|C|$]]|$1|T|3|U|5|F|7|1P|8|@]|9|@]|C|$G|H]]|$1|V|3|J|5|K|7|1Q|8|@]|9|@$A|1R|B|1S|1|1T]]|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|12]]|16|$5|Y|Z|10|C|$11|17]]]]

<h1><a href="http://www.red-lang.org" rel="nofollow noreferrer">Red</a>, 37 bytes</h1>
<pre><code>func[a][foreach[b c]a[print[c lf b]]]
</code></pre>
<p><a href="https://tio.run/##BcG5DYAwEATAnCq2Bd6AMkhXG5izTyAhgyyo/5hpJcdWMqjOV4R/1ZhEv1tJdnCHKfFpZ31puBy7pHCwx4ARE2Ysih8" rel="nofollow noreferrer" title="Red – Try It Online">Try it online!</a></p>
<h2>Alternative</h2>
<p>Much longer but more fun approach using <code>parse</code>:</p>
<h1><a href="http://www.red-lang.org" rel="nofollow noreferrer">Red</a>, 59 bytes</h1>
<pre><code>func[a][parse a[collect[any[b: skip keep skip keep(b/1)]]]]
</code></pre>
<p><a href="https://tio.run/##dcg7DkBAFEbh3ir@kkq8xTK0N7eYx51ECJNBYfVDp@FUJ18QG0exIE7cgOjO1ZBi8irsAkVmWxYxB6n1Ij1gnyePWcS/l@q8yPgp@rBpgQMVKFGhRoOWky9F9@foOd4" rel="nofollow noreferrer" title="Red – Try It Online">Try it online!</a></p>


blocks|key|1262966|text|05AB1E，4+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1262967|2ôí˜|code-block|syntax|javascript|1262968|在网上试试或验证所有测试用例.|unstyled|1262969|4+字节数替代品：|1262970|ιRø˜|1262971|1262972|2ô€`|1262973|1262974|Explanation:|1262975|2ô+++#+Split+the+(implicit)+input-list+into+parts+of+size+2
+++++#++i.e.+[1,2,3,4,5,6]+→+[[1,2],[3,4],[5,6]]
++í++#+Reverse+each+pair
+++++#++→+[[2,1],[4,3],[6,5]]
+++˜+#+Flatten+the+list+of+pairs
+++++#++→+[2,1,4,3,6,5]
+++++#+(after+which+this+list+is+output+implicitly+as+result)

ι++++#+Uninterleave+the+(implicit)+input-list,+using+2+as+implicit+second+argument
+++++#++i.e.+[1,2,3,4,5,6]+→+[[1,3,5],[2,4,6]]
+R+++#+Reverse+it
+++++#++→+[[2,4,6],[1,3,5]]
++ø++#+Zip/transpose,+swapping+rows/columns
+++++#++→+[[2,1],[4,3],[6,5]]
+++˜+#+Flatten+the+list+of+pairs
+++++#++→+[2,1,4,3,6,5]
+++++#+(after+which+this+list+is+output+implicitly+as+result)

2ô+++#+Split+the+(implicit)+input-list+into+parts+of+size+2
+++++#++i.e.+[1,2,3,4,5,6]+→+[[1,2],[3,4],[5,6]]
++€++#+Map+over+each+pair:
+++`+#++Pop+and+push+the+pair+to+the+stack
+++++#+(€`+is+usually+used+to+flatten+a+multi-level+list+one+level+down.+One+side-effect
+++++#+is+that+the+items+are+dumped+in+reversed+order,+which+is+what+we+want+in+this
+++++#+case)
+++++#++→+[2,1,4,3,6,5]
+++++#+(after+which+this+list+is+output+implicitly+as+result)|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E/wiki/Commands|1|https://github.com/Adriandmen/05AB1E/wiki/Codepage|2|https://tio.run/##yy9OTMpM/f/f6PCWw2tPz/n/P9pQx0jHWMdEx1THLBYA|3|https://tio.run/##yy9OTMpM/V9Waa@k8KhtkoKSfeV/o8NbDq89Pee/zv/oaEMdIx1jHRMdUx2zWJ1oAx1DHSCOjQUA|4|5|https://tio.run/##yy9OTMpM/f//3M6gwztOz/n/P9pQx0jHWMdEx1THLBYA|6|https://tio.run/##yy9OTMpM/V9Waa@k8KhtkoKSfeX/czuDDu84Pee/zv/oaEMdIx1jHRMdUx2zWJ1oAx1DHSCOjQUA|7|https://tio.run/##yy9OTMpM/f/f6PCWR01rEv7/jzbUMdIx1jHRMdUxiwUA|8|https://tio.run/##yy9OTMpM/V9Waa@k8KhtkoKSfeV/o8NbHjWtSfiv8z862lDHSMdYx0THVMcsVifaQMdQB4hjYwE^0|0|6|0|9|3|1|0|0|0|5|2|6|8|3|0|2|3|4|0|0|0|5|5|6|8|6|0|0|0|5|7|6|8|8|0|0^^$0|@$1|2|3|4|5|6|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]|$A|1N|B|1O|1|1P]]|C|$]]|$1|D|3|E|5|F|7|1Q|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1R|8|@]|9|@$A|1S|B|1T|1|1U]|$A|1V|B|1W|1|1X]]|C|$]]|$1|L|3|M|5|6|7|1Y|8|@]|9|@$A|1Z|B|20|1|21]]|C|$]]|$1|N|3|O|5|F|7|22|8|@]|9|@]|C|$G|H]]|$1|P|3|J|5|K|7|23|8|@]|9|@$A|24|B|25|1|26]|$A|27|B|28|1|29]]|C|$]]|$1|Q|3|R|5|F|7|2A|8|@]|9|@]|C|$G|H]]|$1|S|3|J|5|K|7|2B|8|@]|9|@$A|2C|B|2D|1|2E]|$A|2F|B|2G|1|2H]]|C|$]]|$1|T|3|U|5|6|7|2I|8|@]|9|@]|C|$]]|$1|V|3|W|5|F|7|2J|8|@]|9|@]|C|$G|H]]]|X|$Y|$5|Z|10|11|C|$12|13]]|14|$5|Z|10|11|C|$12|15]]|16|$5|Z|10|11|C|$12|17]]|18|$5|Z|10|11|C|$12|19]]|1A|$5|Z|10|11|C|$12|15]]|1B|$5|Z|10|11|C|$12|1C]]|1D|$5|Z|10|11|C|$12|1E]]|1F|$5|Z|10|11|C|$12|1G]]|1H|$5|Z|10|11|C|$12|1I]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E/wiki/Commands" rel="nofollow noreferrer">05AB1E</a>, 4 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>2ôí˜
</code></pre>
<p><a href="https://tio.run/##yy9OTMpM/f/f6PCWw2tPz/n/P9pQx0jHWMdEx1THLBYA" rel="nofollow noreferrer">Try it online</a> or <a href="https://tio.run/##yy9OTMpM/V9Waa@k8KhtkoKSfeV/o8NbDq89Pee/zv/oaEMdIx1jHRMdUx2zWJ1oAx1DHSCOjQUA" rel="nofollow noreferrer">verify all test cases</a>.</p>
<p><strong>4 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a> alternatives:</strong></p>
<pre><code>ιRø˜
</code></pre>
<p><a href="https://tio.run/##yy9OTMpM/f//3M6gwztOz/n/P9pQx0jHWMdEx1THLBYA" rel="nofollow noreferrer">Try it online</a> or <a href="https://tio.run/##yy9OTMpM/V9Waa@k8KhtkoKSfeX/czuDDu84Pee/zv/oaEMdIx1jHRMdUx2zWJ1oAx1DHSCOjQUA" rel="nofollow noreferrer">verify all test cases</a>.</p>
<pre><code>2ô€`
</code></pre>
<p><a href="https://tio.run/##yy9OTMpM/f/f6PCWR01rEv7/jzbUMdIx1jHRMdUxiwUA" rel="nofollow noreferrer">Try it online</a> or <a href="https://tio.run/##yy9OTMpM/V9Waa@k8KhtkoKSfeV/o8NbHjWtSfiv8z862lDHSMdYx0THVMcsVifaQMdQB4hjYwE" rel="nofollow noreferrer">verify all test cases</a>.</p>
<p><strong>Explanation:</strong></p>

<pre class="lang-python prettyprint-override"><code>2ô   # Split the (implicit) input-list into parts of size 2
     #  i.e. [1,2,3,4,5,6] → [[1,2],[3,4],[5,6]]
  í  # Reverse each pair
     #  → [[2,1],[4,3],[6,5]]
   ˜ # Flatten the list of pairs
     #  → [2,1,4,3,6,5]
     # (after which this list is output implicitly as result)

ι    # Uninterleave the (implicit) input-list, using 2 as implicit second argument
     #  i.e. [1,2,3,4,5,6] → [[1,3,5],[2,4,6]]
 R   # Reverse it
     #  → [[2,4,6],[1,3,5]]
  ø  # Zip/transpose, swapping rows/columns
     #  → [[2,1],[4,3],[6,5]]
   ˜ # Flatten the list of pairs
     #  → [2,1,4,3,6,5]
     # (after which this list is output implicitly as result)

2ô   # Split the (implicit) input-list into parts of size 2
     #  i.e. [1,2,3,4,5,6] → [[1,2],[3,4],[5,6]]
  €  # Map over each pair:
   ` #  Pop and push the pair to the stack
     # (€` is usually used to flatten a multi-level list one level down. One side-effect
     # is that the items are dumped in reversed order, which is what we want in this
     # case)
     #  → [2,1,4,3,6,5]
     # (after which this list is output implicitly as result)
</code></pre>


blocks|key|1266750|text|维姆，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1266751|qqddpj@qq@q|code-block|syntax|javascript|1266752|在网上试试！|unstyled|1266753|解释：|1266754|qq++++@qq@q+#+Loop:
++dd++++++++#++Delete+the+line
++++p+++++++#++Paste+it+below+the+next+line
+++++j++++++#++Move+down+a+line|entityMap|0|LINK|mutability|MUTABLE|url|https://www.vim.org/|1|https://tio.run/##K/v/v7AwJaUgy6Gw0KHw/39DLiMuYy4TLlMuMwA^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://www.vim.org" rel="nofollow noreferrer">Vim</a>, 11 bytes</h1>
<pre><code>qqddpj@qq@q
</code></pre>
<p><a href="https://tio.run/##K/v/v7AwJaUgy6Gw0KHw/39DLiMuYy4TLlMuMwA" rel="nofollow noreferrer" title="V (vim) – Try It Online">Try it online!</a></p>
<p>Explanation:</p>
<pre><code>qq    @qq@q # Loop:
  dd        #  Delete the line
    p       #  Paste it below the next line
     j      #  Move down a line
</code></pre>


blocks|key|1266837|text|APL，15字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1266838|{,⌽⍵⍴⍨(2÷⍨≢⍵)2}|code-block|syntax|javascript|1266839|与现有解决方案中的想法相同，但作为一个单独的函数实现，并且减少了两个字节。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>APL, 15 bytes</h1>
<pre><code>{,⌽⍵⍴⍨(2÷⍨≢⍵)2}
</code></pre>
<p>The same idea as in the existing solution, but implemented as a separate function and two bytes less.</p>


blocks|key|1264045|text|维沙尔，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264046|2ẇRf|code-block|syntax|javascript|1264047|在网上试试！|unstyled|1264048|解释：|1264049|2ẇ+++#+Split+list+into+groups+of+two
++R++#+Reverse+each+group
+++f+#+Flatten|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://lyxal.pythonanywhere.com/?flags=&code=2%25E1%25BA%2587Rf&inputs=%255B1%252C2%252C3%252C4%252C5%252C6%255D&header=&footer=^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|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/Vyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a>, 4 bytes</h1>
<pre><code>2ẇRf
</code></pre>
<p><a href="https://lyxal.pythonanywhere.com?flags=&amp;code=2%E1%BA%87Rf&amp;inputs=%5B1%2C2%2C3%2C4%2C5%2C6%5D&amp;header=&amp;footer=" rel="nofollow noreferrer">Try it Online!</a></p>
<p>Explanation:</p>
<pre><code>2ẇ   # Split list into groups of two
  R  # Reverse each group
   f # Flatten
</code></pre>


blocks|key|1260665|text|格罗克，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1260666|:Y}:zpz
++q|code-block|syntax|javascript|1260667|在网上试试！|unstyled|1260668|解释：|1260669|:Y++++++#+Get+input+and+copy+it+to+the+register
++}+++++#+Quit+if+no+more+input
++q
+++:z+++#+Print+next+input
+++++pz+#+Print+value+in+the+register|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/AMiller42/Grok-Language|1|http://grok.pythonanywhere.com/?flags=&code=%253AY%257D%253Azpz%250A%2520%2520q&inputs=1%250A2%250A3%250A4%250A5%250A6^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|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/AMiller42/Grok-Language" rel="nofollow noreferrer">Grok</a>, 11 bytes</h1>
<pre><code>:Y}:zpz
  q
</code></pre>
<p><a href="http://grok.pythonanywhere.com?flags=&amp;code=%3AY%7D%3Azpz%0A%20%20q&amp;inputs=1%0A2%0A3%0A4%0A5%0A6" rel="nofollow noreferrer">Try it Online!</a></p>
<p>Explanation:</p>
<pre><code>:Y      # Get input and copy it to the register
  }     # Quit if no more input
  q
   :z   # Print next input
     pz # Print value in the register
</code></pre>


blocks|key|1260964|text|艾尔，6字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1260965|,_2,`/|code-block|syntax|javascript|1260966|解释了|1260967|+_2+…+/++++pairwise+reduce
++++,`+++++By+reverse+concatenation
,+++++++++Ravel|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ZippyMagician/ayr^0|0|2|0|0|0|0^^$0|@$1|2|3|4|5|6|7|T|8|@]|9|@$A|U|B|V|1|W]]|C|$]]|$1|D|3|E|5|F|7|X|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|Y|8|@]|9|@]|C|$]]|$1|K|3|L|5|F|7|Z|8|@]|9|@]|C|$G|H]]]|M|$N|$5|O|P|Q|C|$R|S]]]]

<h1><a href="https://github.com/ZippyMagician/ayr" rel="nofollow noreferrer">ayr</a>, 6 bytes</h1>
<pre><code>,_2,`/
</code></pre>
<h1>Explained</h1>
<pre><code> _2 … /    pairwise reduce
    ,`     By reverse concatenation
,         Ravel
</code></pre>


blocks|key|1265441|text|杰夫特，4+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1265442|ò+mé|code-block|syntax|javascript|1265443|试试看|unstyled|1265444|ò++++++-+chunks+of+2
++mé+++-+rotate+each|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|https://en.wikipedia.org/wiki/ISO/IEC_8859-1|2|https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=8iBt6Q&input=WzEsMiwzLDQsNSw2XQo^0|0|3|0|6|3|1|0|0|0|3|2|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]|$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|F|7|1A|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]|W|$5|P|Q|R|C|$S|X]]]]

<h1><a href="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 4 <a href="https://en.wikipedia.org/wiki/ISO/IEC_8859-1" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>ò mé
</code></pre>
<p><a href="https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&amp;code=8iBt6Q&amp;input=WzEsMiwzLDQsNSw2XQo" rel="nofollow noreferrer">Try it</a></p>
<pre><code>ò      - chunks of 2
  mé   - rotate each
</code></pre>


blocks|key|1266053|text|帕里/GP，27字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1266054|l->[l[i-(-1)%5Ei]%7Ci<-[1..#l]]|code-block|syntax|javascript|1266055|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://pari.math.u-bordeaux.fr/|1|https://tio.run/##Fcc9CoAwDEDhqwRdWkjE@jepFwkRXJRAkSAOCt691uHB@2w9lXZLG0wp0syRlRwFv6i8OhKHqiqjSFrN4uNuoBns1OPKW/woYHO39wjMARtsscMeB8muMWBOxKcP^0|0|5|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="http://pari.math.u-bordeaux.fr/" rel="nofollow noreferrer">Pari/GP</a>, 27 bytes</h1>
<pre><code>l-&gt;[l[i-(-1)^i]|i&lt;-[1..#l]]
</code></pre>
<p><a href="https://tio.run/##Fcc9CoAwDEDhqwRdWkjE@jepFwkRXJRAkSAOCt691uHB@2w9lXZLG0wp0syRlRwFv6i8OhKHqiqjSFrN4uNuoBns1OPKW/woYHO39wjMARtsscMeB8muMWBOxKcP" rel="nofollow noreferrer" title="Pari/GP – Try It Online">Try it online!</a></p>


blocks|key|1266559|text|Pxem，18+%2B0=+18字节。|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1266560|配置如下：|unstyled|1266561|当项目不足时，没有中断循环。|unordered-list-item|1266562|中止到非法整数输入。|1266563|文件名：|1266564|.w._._.n+.o.n+.o.a|code-block|syntax|javascript|1266565|内容是空的。|1266566|在网上试试！|1266567|使用|1266568|用STDIN和STDOUT。|1266569|每个整数都应由一个或多个空格字符分隔。|1266570|用空格分隔的输出。|entityMap|0|LINK|mutability|MUTABLE|url|https://esolangs.org/wiki/Pxem|1|https://tio.run/##pTp7X@LIsv/nU7QRhQghgI46YpxFBx3OKHgU78wecfKL0EgUEjYdFB/cr763qrvzxJnds1dHhnQ9urpeXdWdZ5uN/lxdMW4d12AjRVkl0zmdlCcPAZ1My3RyW556zJk7bFImjqv3vQEl54ABDwH1pz6Fz7KyCnTH1A5mPmXwRHRy5E2mduDcjil5coIRcR/KecaJ3AEdEDalQ2fo9AHFcznB4XNA9ZnrBKQ/sn27D3z5eNsjbAxCEtfziTsbj8kQvgydMXXtCeUol4FP7Ynu@Q4F/gPSMjpcom@@E8B85Pa5TLpTmx7bTy/URfmOHdcek9l0YAe0TGqVWrVc2SlvVslV96j4ETFOnT51GQCPgHfgPFJc0cRzGfkP9T3yCARl1NYdDch557L1ffxM2AwU4jA6powR6j46vudOQCSFAZJOZ8psYrMHUqns7JBVWE8AX2u1OrEZX5PQuULnU88PyOmR1Tg9NY@U4HlKcZq@5w7JgTGgjwZXQ@1gvUrW1wW8D8LZ7uA9uOR33uh@MdVcIcTUpxFTBAF6RKrlXnGouLcQX/SFGnK5are@W5fdz2atUtmERaDcX871q@/RNKiL09@to87FRfOoa1Yl0kn76s9Vcn7VJb93ri7I@ffmGbmEb0dN8qV50VSOW6fNduOsaebLT2ULfl1S9sSHnVeOOu1us901Ffx23Dox88ph86TVflUIIVeXTevwyKzW8eHwotn4ap12OufWty/NttVqX14dH7eOWkhe4SiNw85F1zq86HwFOGJKUjHeOj1tnjROgbDbPGleIGyRB9H7I9p/cNy72PWcIVKBxd1gSNZYr@cSNReuQyVvCL3z6ZTofxC9SXr4DD/5wo@36x@93o3W6xUqbxX8x/8qWuH6R0XfvXnLaXmiBCPqIgntjzzSRotGgQFxFIlBqgfrNY43h9ipKkNH@eeSGW9J4T7svFXwDz4Somn5tGiXPDr/QiLQnzdzA5DJu/PtiYIuMUeipFxqTtpZTQxHY3Uy8JLLugWkOSyGPPWJ3heTDjyXKiIiRDQtBcTbG@FOI8AFrSDXzkP0SD4MHD@YTCFaXrtn559bF3sYAQLUtxmFiQWGiiso5POaBMakBnzIwXq9YLyDUI7BG8tgmFp8WzOiqet1yuy@fOBJkGsbRMiFqyjEjJwhuSa6T/j6Zz6EvDchN5AQcLifGa6T0KTRjwcpokFcogdksEX0NoGPxxRZjE7HjKaIC1OG1LpHps6gRANnQkvT/nRWemQvYEfIuprwwvemm/GZ0uDAB@swUqnWNrc@bO/sfiT56567cZPP4HGvLmeJbWdMdJds1TIABptFnhk/yhu9Qrn3uttb9LSc0asaWbb20wPKZJt6rbq1s7W7ub21S/IplFe7aOYq9UWz/fmVuyixFwkMCALxJV44Ms2/xigM1VrIVbR6ggxNDL5pqvZtf0CHdyPn/mE8cb3pHz4LZo9P8@eXxuHR5@bxyZfWv76enrU75/@@uOxe/c@377//J1aXpSaYnpoQqHfBqBByT83o@QUHsp6zb1YrdadY1F5T60T4PcDvAb5Vvwd4ChwHKJvdssCP5ijBYIGvUNs41UrV5JwhEVGTYi7k10iNWpgCxM8eOYgi0cjxeVTc8LKChAnwF5hQxsx8l1TC@Mc0Il0bU5wqssUeGYIngc8EHuydLvXBj4lNEOT5tv/MM6Aapb@YbxUfNWWhKP0xtV0LxOBCFIRuee7RSe61ComG5D4p3OHtKcnnSfN7q0u@XJ0T2I/Iv6/g4bx13iSN04sz0m1enCGuPyH6EBYYslUjBvrfoud5OlcF@UIOWCiINWuq3MDRW1nfd6aBwlmnV/LX8yiRNUSeh11cPThICq1AaTIFDUqtJPN8VW5aySxRjbLEUnJAe6fyQzItrBLPv7Nd54WSsQObKRSC4KewswugT/veHYc@2mMHbf0AhaASJ4HPna65tS2iPy5C4GfMgErWGLhTTAbX1WrtxsQvu5UbU52qaVhVwHY@AszLwCoStgswNw2rfJCwTYA5KdhHAKlWeuijwN7eAVA/M4vktIucWAa2K2HbAHvMSCBXtYOrGmZgclXbuCqa4bkleQK96mdgUs5dlPMpDatJbeyiNuYZmJxvF@d7zsCknB9Rzpe0WnakmKgxOyPKtmQJ4qpBZnlSzB0Uc5KBSTG3UcxBCraFGi6mh3BmPTW0iVgr6SFUfy49hFOvRUPCH/kTz5ihO0Jv9uh4M2ZKL7/m/nkTkoWjxaIYx81LCUuHQkRsAvv19VwFywyYPLkZ4E7AaXWzVudfxKeua8upfaiGwbY26Llq6X2hoo0A15mrROOLaHW4vcYlUOGn8/7dSRf5MCs8jZz@iHhDgnsqbAGUQW6f2AEMYgf7SWDR8l2ZPJH5fI6Z3wu/PgkoFF22IMXujhOXeGlFmGEbDYNg5@XcQStLyXDmA8QXhMwjDVDxADtioL71MesQO5F2XMqC8aNZEYnH@HGNYt7kjFAbfDIUFCwqcJMm5eqou3QexI5i/LBjcrC5nMGsJI3MCdWGWuebRCVlkCTZwTLVULXX@qj2WDSBq@tJg0dCpexcrUeGsQcDMrZvocjkz2KwddbqNrqt9gk56XQ75BIemmfQJlySby3oZo87p6edbwhufPtKLtut8/Nmd0@Qcr@pC3FXxRo4exNyy3yuaq/wuQiBWNr@GqNcLieROQyeur4jKwUPP10oKeYOC7CD5LwEzSKxJMd1Ascej5@hDBIj4B5QYMDfyHsCPoGnA7lcBfdSdCfo4jlXCFDwJzL2PChUmJEzSkYGkzseosZ4hGP@JjHtJ3v@9GwL7L7nAt9ZGp8Zpd82YtZIYIcEtz61H5bZc4JwhsYeKgM3@jENKCx14AyHsEoIeVlzrZLOYfdbGAGCDS4dNPiE@ghDIrH/Ctuo6oKfqgj1gltRPGgSh0VQK5Op7QfCs94PIOGbxWLoi1C/FiDzlvCXs9RSwURUMY8q5kuF1fusdT3FGvUCvH/7@9yjiABVYH3nsjFWoPJEh6Fm7Sl02MABx0GhTAm7HCGZYBrJxQxjkXVwI4LlDPD08PE2sb4wqSb5TGdsVEjSasuU0GlNcwbkWajxVqC2DJ4LmjadBXiuUZh60I0LIsDzcgbI9BdI7hISni/e0SyekxPi4XkXcokhVgwJSWNgP8seEIMUY5bBQGAIe8wZsIdSn9F4bJgzEu0VBhg4vsV3MGy0@Axy9Nq5ichozgCP8T1cX4Kb/458iSZL6CDCDn0STQ1BZcE8g4K6rmraO47OnSIaj1w05GX3CoIdtstphr1qyFH693tMs64f8m3kDBnLn9S6zD80BAbp5QbeiNrTjKUnHIcDpEKGvjeRzyHSIGfwVBVppriSW9OFatAWBe3ArGm2DxvWBPyiz7XEkaMABI4DMC1Pe0PPg3DgkVaIDsXyvDiSeQk3m0SEQVTxcIStPsbnEkXBuHREqdm3nh9YqGjBRxNdMW8qXxPTztw@HqlDOeC4EvOVBXb/4doZmFCfVsTUotNKnr7FPBYRk4TXcVYlFm3yzBSqqgvmxaIzAOZK8gyhAk7OuGMnCgO0SSiPXi2Bl2cECo/7YnmiqQYUNw1ioT2RXL/57@Yr8vlAcQuS6TxX0RjJDrrOm2JFge0Kcrc4NYzOLKEtz4@c8nRO86RRhl/ikfLTyz3zyvflefml/FS2SXlOys/EfqBeeQADgzIt2@H5hThUyM3V9NLn0aLFQSaeF4BYKVnJ/n7@@Kp91G112pd5JTIV94/ChN0lmmcCj28qssAjCdEwiDPZOvKGqlMq5oY4jKCSE2OgKjKyGYFcP2ElUoHSY0DndBCigIe5znQ2Fjc4kRwyPF/lyUc0A5SVixhLGHQJKYHBDWc5sfOWIqxi8ca0nCQu5oAss5KuRxRJxsG7yBGqXk0ihxncckrWvdAs@pqFzmaBt4VURg0eE0dl1r0ZsbacqNpNjpnvza2/h5yBm9a9LDa4DTEY4L/JDNxUBsgTNhxihfzCAlJgIpTj1Ym8GOrCGaBv8@BKaCDOnyFeGH5ppXIctFcE5jYCyRwPPu5RPMbv6Xityss5GLfH0Plw4O0zSM7oHzPq9qmE3s6wiXq@peK20e7zizggxtuGGd42Jh1GbO4oQ@L4SO3Bz5qHbYjlKCkHi7Z8tG5fUEHuBbvGvUzIdeuDVsc2DUro0MTOhqlX47KP@0Ufdnarvx@er4Is8Jjwi5CdPBvlE5eqWnFrl7O3GZtx/TQuj1qt0MiRyGH9YvmRsLwvt2YugG5nw9j/fDMavI7b6DCBvgMKjevHKwL2WBiNwWdgXNuHxjCNLJefIE0Iy@eILJKcMh28DmNTu085luRU@LgPOOvrFp5Bb2lvbxBv5mZtwf3lzuMbM2F46gj5Sdi5oK4N1NI66BuQUhqLjIy2K6HG/TiQ6xjKcVm4AhZdX09IVA9XzBfKWZjyjJp7imlubQrxwEESrbQcCSniU57kdClNw1q3dt/ePuzshw4sxt@9lExscCLvq2Vrjx852C6RC4b/wdvUqK3gvWlMt0oGMxeaJWcI9ruDNO5j@xAbTeO@zgucYAQuyQhev3tBkkPna@N3Ah7F0oCU5evLh@zLzf4qwRsi3qsNnDsn4MUU@jDKUI@MtbUb@8WHnXrKdEnP96GBJjC5jmEVTbIsVspx@RWlO3DQb@xxZmNNFl5h6IXl3Cc1NEdoC3uPTMCJMJDLTyWoBODvuYQKLL9IgyRuzEIqlVhjmwW8jiZqgoWNNImIiatt/lmyeH9bshjFRyFfzMrkn5HL8iE8YE06WVhTL9lq5VfX6ZnUwXfhFXn@vVAyLhfV1vu1fziNWKbJp4nGxJrTg4llzlUtsjIn35cU7@A@Z3EPfo77ksVdMZPIcmt@Gj0Th9gT2MPkuYiDZ4qhIff42dQIQmxMGRk7EwdfXoHu7Y7iMaSMY1YCTpRNaV@cDUG@P/YpPbz8XCeV@c6x@MECDo9dJvac8AYbYLsV8YMw2FUUebKCkzr8sEBMTaA@HFNwF3LaaZ/wsKeDeHZ5LgoUBybZrJFbCE98Qeas8fthEzaqr/j@xcUl6XbI5@ZR63OTgAW7X5oXOAIgcniUCKa4qbK8Kc/G9yXrIYop8SpHHMyOtCzUU0smdvbDkkwiP0BywKQA9RHgWw/Zs0oAsXC34BX4Guupa334Y@QNL5F6vZVeLwf/bRgwcNtXuYAo533scfcmTA3gaGd8SEl1/05uhsj2phjS8fLlTWKcnkW9@6D9NHqAhYlXCBqJGn2ukqLs8@tZ1JUl1I2foepq6vA2RaRniAQdr6L3K5mD/vRsejWmWqSm/F/1Ord2k5r0p6YOrb0BADMz4ZKCX6jv6QPn0WHgbeoSj4zH/MppEjInVyb0lVM/WY5h3e9Zzhqw1DI72kKJOrSfdHCtdqubV9oXpll9ja/9LSiPB5Y8AIJKEk/GF4B1YNZg00sCw3gxqDvoG1p8BwBNv5Y8ql@IDlMcKRWLySMnfj0gDt8XCgqE3W7euw2ACWHezO9De8sb38IeNpCbWvIdMXl9nmmbOR4QvfP60WtldXXDWJDNAzxywPQjpwpv0gfyelleoPMMOsT39MbPSkHekoijLWgToA/9f73jknm75VG84JJ9uyWxS/83b7T89F2Wv76oXn6F5Z2XV957bSX91sov31cRb6osv6giXlERt/3lYfYKPno16x9exEfnHuiyciJh3fClMFGx/kPuGqZkqTneSUVMJs7dCNpLege@xl9F5dW9wlWUemuCE4JD8/gB54N2GeRBdUzsAN@6Q8WIHhabWqnjM3xXInyTsnFxYp01vqcCBUKIr3ur8nFbU0n45uKZYdbqZ7q5i7cWol/EXV@VOoeGVZFdJCOQHA7OpLFYneFVh/LKTAQslNiOjN8QzG0fqnW9RV5C@738WSU1sgkO/oFs/x8^0|0|4|0|0|0|0|0|0|0|0|0|6|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|D|3|E|5|F|7|1H|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|1I|8|@]|9|@]|C|$]]|$1|J|3|K|5|I|7|1J|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|1K|8|@]|9|@]|C|$]]|$1|N|3|O|5|P|7|1L|8|@]|9|@]|C|$Q|R]]|$1|S|3|T|5|F|7|1M|8|@]|9|@]|C|$]]|$1|U|3|V|5|F|7|1N|8|@]|9|@$A|1O|B|1P|1|1Q]]|C|$]]|$1|W|3|X|5|6|7|1R|8|@]|9|@]|C|$]]|$1|Y|3|Z|5|I|7|1S|8|@]|9|@]|C|$]]|$1|10|3|11|5|I|7|1T|8|@]|9|@]|C|$]]|$1|12|3|13|5|I|7|1U|8|@]|9|@]|C|$]]]|14|$15|$5|16|17|18|C|$19|1A]]|1B|$5|16|17|18|C|$19|1C]]]]

<h1><a href="https://esolangs.org/wiki/Pxem" rel="nofollow noreferrer">Pxem</a>, 18 + 0 = 18 bytes.</h1>
<p>The configure is:</p>
<ul>
<li>No breaking loop when insufficient items.</li>
<li>Abort to illegal integer input.</li>
</ul>
<p>Filename:</p>
<pre><code>.w._._.n .o.n .o.a
</code></pre>
<p>Content is empty.</p>
<p><a href="https://tio.run/##pTp7X@LIsv/nU7QRhQghgI46YpxFBx3OKHgU78wecfKL0EgUEjYdFB/cr763qrvzxJnds1dHhnQ9urpeXdWdZ5uN/lxdMW4d12AjRVkl0zmdlCcPAZ1My3RyW556zJk7bFImjqv3vQEl54ABDwH1pz6Fz7KyCnTH1A5mPmXwRHRy5E2mduDcjil5coIRcR/KecaJ3AEdEDalQ2fo9AHFcznB4XNA9ZnrBKQ/sn27D3z5eNsjbAxCEtfziTsbj8kQvgydMXXtCeUol4FP7Ynu@Q4F/gPSMjpcom@@E8B85Pa5TLpTmx7bTy/URfmOHdcek9l0YAe0TGqVWrVc2SlvVslV96j4ETFOnT51GQCPgHfgPFJc0cRzGfkP9T3yCARl1NYdDch557L1ffxM2AwU4jA6powR6j46vudOQCSFAZJOZ8psYrMHUqns7JBVWE8AX2u1OrEZX5PQuULnU88PyOmR1Tg9NY@U4HlKcZq@5w7JgTGgjwZXQ@1gvUrW1wW8D8LZ7uA9uOR33uh@MdVcIcTUpxFTBAF6RKrlXnGouLcQX/SFGnK5are@W5fdz2atUtmERaDcX871q@/RNKiL09@to87FRfOoa1Yl0kn76s9Vcn7VJb93ri7I@ffmGbmEb0dN8qV50VSOW6fNduOsaebLT2ULfl1S9sSHnVeOOu1us901Ffx23Dox88ph86TVflUIIVeXTevwyKzW8eHwotn4ap12OufWty/NttVqX14dH7eOWkhe4SiNw85F1zq86HwFOGJKUjHeOj1tnjROgbDbPGleIGyRB9H7I9p/cNy72PWcIVKBxd1gSNZYr@cSNReuQyVvCL3z6ZTofxC9SXr4DD/5wo@36x@93o3W6xUqbxX8x/8qWuH6R0XfvXnLaXmiBCPqIgntjzzSRotGgQFxFIlBqgfrNY43h9ipKkNH@eeSGW9J4T7svFXwDz4Somn5tGiXPDr/QiLQnzdzA5DJu/PtiYIuMUeipFxqTtpZTQxHY3Uy8JLLugWkOSyGPPWJ3heTDjyXKiIiRDQtBcTbG@FOI8AFrSDXzkP0SD4MHD@YTCFaXrtn559bF3sYAQLUtxmFiQWGiiso5POaBMakBnzIwXq9YLyDUI7BG8tgmFp8WzOiqet1yuy@fOBJkGsbRMiFqyjEjJwhuSa6T/j6Zz6EvDchN5AQcLifGa6T0KTRjwcpokFcogdksEX0NoGPxxRZjE7HjKaIC1OG1LpHps6gRANnQkvT/nRWemQvYEfIuprwwvemm/GZ0uDAB@swUqnWNrc@bO/sfiT56567cZPP4HGvLmeJbWdMdJds1TIABptFnhk/yhu9Qrn3uttb9LSc0asaWbb20wPKZJt6rbq1s7W7ub21S/IplFe7aOYq9UWz/fmVuyixFwkMCALxJV44Ms2/xigM1VrIVbR6ggxNDL5pqvZtf0CHdyPn/mE8cb3pHz4LZo9P8@eXxuHR5@bxyZfWv76enrU75/@@uOxe/c@377//J1aXpSaYnpoQqHfBqBByT83o@QUHsp6zb1YrdadY1F5T60T4PcDvAb5Vvwd4ChwHKJvdssCP5ijBYIGvUNs41UrV5JwhEVGTYi7k10iNWpgCxM8eOYgi0cjxeVTc8LKChAnwF5hQxsx8l1TC@Mc0Il0bU5wqssUeGYIngc8EHuydLvXBj4lNEOT5tv/MM6Aapb@YbxUfNWWhKP0xtV0LxOBCFIRuee7RSe61ComG5D4p3OHtKcnnSfN7q0u@XJ0T2I/Iv6/g4bx13iSN04sz0m1enCGuPyH6EBYYslUjBvrfoud5OlcF@UIOWCiINWuq3MDRW1nfd6aBwlmnV/LX8yiRNUSeh11cPThICq1AaTIFDUqtJPN8VW5aySxRjbLEUnJAe6fyQzItrBLPv7Nd54WSsQObKRSC4KewswugT/veHYc@2mMHbf0AhaASJ4HPna65tS2iPy5C4GfMgErWGLhTTAbX1WrtxsQvu5UbU52qaVhVwHY@AszLwCoStgswNw2rfJCwTYA5KdhHAKlWeuijwN7eAVA/M4vktIucWAa2K2HbAHvMSCBXtYOrGmZgclXbuCqa4bkleQK96mdgUs5dlPMpDatJbeyiNuYZmJxvF@d7zsCknB9Rzpe0WnakmKgxOyPKtmQJ4qpBZnlSzB0Uc5KBSTG3UcxBCraFGi6mh3BmPTW0iVgr6SFUfy49hFOvRUPCH/kTz5ihO0Jv9uh4M2ZKL7/m/nkTkoWjxaIYx81LCUuHQkRsAvv19VwFywyYPLkZ4E7AaXWzVudfxKeua8upfaiGwbY26Llq6X2hoo0A15mrROOLaHW4vcYlUOGn8/7dSRf5MCs8jZz@iHhDgnsqbAGUQW6f2AEMYgf7SWDR8l2ZPJH5fI6Z3wu/PgkoFF22IMXujhOXeGlFmGEbDYNg5@XcQStLyXDmA8QXhMwjDVDxADtioL71MesQO5F2XMqC8aNZEYnH@HGNYt7kjFAbfDIUFCwqcJMm5eqou3QexI5i/LBjcrC5nMGsJI3MCdWGWuebRCVlkCTZwTLVULXX@qj2WDSBq@tJg0dCpexcrUeGsQcDMrZvocjkz2KwddbqNrqt9gk56XQ75BIemmfQJlySby3oZo87p6edbwhufPtKLtut8/Nmd0@Qcr@pC3FXxRo4exNyy3yuaq/wuQiBWNr@GqNcLieROQyeur4jKwUPP10oKeYOC7CD5LwEzSKxJMd1Ascej5@hDBIj4B5QYMDfyHsCPoGnA7lcBfdSdCfo4jlXCFDwJzL2PChUmJEzSkYGkzseosZ4hGP@JjHtJ3v@9GwL7L7nAt9ZGp8Zpd82YtZIYIcEtz61H5bZc4JwhsYeKgM3@jENKCx14AyHsEoIeVlzrZLOYfdbGAGCDS4dNPiE@ghDIrH/Ctuo6oKfqgj1gltRPGgSh0VQK5Op7QfCs94PIOGbxWLoi1C/FiDzlvCXs9RSwURUMY8q5kuF1fusdT3FGvUCvH/7@9yjiABVYH3nsjFWoPJEh6Fm7Sl02MABx0GhTAm7HCGZYBrJxQxjkXVwI4LlDPD08PE2sb4wqSb5TGdsVEjSasuU0GlNcwbkWajxVqC2DJ4LmjadBXiuUZh60I0LIsDzcgbI9BdI7hISni/e0SyekxPi4XkXcokhVgwJSWNgP8seEIMUY5bBQGAIe8wZsIdSn9F4bJgzEu0VBhg4vsV3MGy0@Axy9Nq5ichozgCP8T1cX4Kb/458iSZL6CDCDn0STQ1BZcE8g4K6rmraO47OnSIaj1w05GX3CoIdtstphr1qyFH693tMs64f8m3kDBnLn9S6zD80BAbp5QbeiNrTjKUnHIcDpEKGvjeRzyHSIGfwVBVppriSW9OFatAWBe3ArGm2DxvWBPyiz7XEkaMABI4DMC1Pe0PPg3DgkVaIDsXyvDiSeQk3m0SEQVTxcIStPsbnEkXBuHREqdm3nh9YqGjBRxNdMW8qXxPTztw@HqlDOeC4EvOVBXb/4doZmFCfVsTUotNKnr7FPBYRk4TXcVYlFm3yzBSqqgvmxaIzAOZK8gyhAk7OuGMnCgO0SSiPXi2Bl2cECo/7YnmiqQYUNw1ioT2RXL/57@Yr8vlAcQuS6TxX0RjJDrrOm2JFge0Kcrc4NYzOLKEtz4@c8nRO86RRhl/ikfLTyz3zyvflefml/FS2SXlOys/EfqBeeQADgzIt2@H5hThUyM3V9NLn0aLFQSaeF4BYKVnJ/n7@@Kp91G112pd5JTIV94/ChN0lmmcCj28qssAjCdEwiDPZOvKGqlMq5oY4jKCSE2OgKjKyGYFcP2ElUoHSY0DndBCigIe5znQ2Fjc4kRwyPF/lyUc0A5SVixhLGHQJKYHBDWc5sfOWIqxi8ca0nCQu5oAss5KuRxRJxsG7yBGqXk0ihxncckrWvdAs@pqFzmaBt4VURg0eE0dl1r0ZsbacqNpNjpnvza2/h5yBm9a9LDa4DTEY4L/JDNxUBsgTNhxihfzCAlJgIpTj1Ym8GOrCGaBv8@BKaCDOnyFeGH5ppXIctFcE5jYCyRwPPu5RPMbv6Xityss5GLfH0Plw4O0zSM7oHzPq9qmE3s6wiXq@peK20e7zizggxtuGGd42Jh1GbO4oQ@L4SO3Bz5qHbYjlKCkHi7Z8tG5fUEHuBbvGvUzIdeuDVsc2DUro0MTOhqlX47KP@0Ufdnarvx@er4Is8Jjwi5CdPBvlE5eqWnFrl7O3GZtx/TQuj1qt0MiRyGH9YvmRsLwvt2YugG5nw9j/fDMavI7b6DCBvgMKjevHKwL2WBiNwWdgXNuHxjCNLJefIE0Iy@eILJKcMh28DmNTu085luRU@LgPOOvrFp5Bb2lvbxBv5mZtwf3lzuMbM2F46gj5Sdi5oK4N1NI66BuQUhqLjIy2K6HG/TiQ6xjKcVm4AhZdX09IVA9XzBfKWZjyjJp7imlubQrxwEESrbQcCSniU57kdClNw1q3dt/ePuzshw4sxt@9lExscCLvq2Vrjx852C6RC4b/wdvUqK3gvWlMt0oGMxeaJWcI9ruDNO5j@xAbTeO@zgucYAQuyQhev3tBkkPna@N3Ah7F0oCU5evLh@zLzf4qwRsi3qsNnDsn4MUU@jDKUI@MtbUb@8WHnXrKdEnP96GBJjC5jmEVTbIsVspx@RWlO3DQb@xxZmNNFl5h6IXl3Cc1NEdoC3uPTMCJMJDLTyWoBODvuYQKLL9IgyRuzEIqlVhjmwW8jiZqgoWNNImIiatt/lmyeH9bshjFRyFfzMrkn5HL8iE8YE06WVhTL9lq5VfX6ZnUwXfhFXn@vVAyLhfV1vu1fziNWKbJp4nGxJrTg4llzlUtsjIn35cU7@A@Z3EPfo77ksVdMZPIcmt@Gj0Th9gT2MPkuYiDZ4qhIff42dQIQmxMGRk7EwdfXoHu7Y7iMaSMY1YCTpRNaV@cDUG@P/YpPbz8XCeV@c6x@MECDo9dJvac8AYbYLsV8YMw2FUUebKCkzr8sEBMTaA@HFNwF3LaaZ/wsKeDeHZ5LgoUBybZrJFbCE98Qeas8fthEzaqr/j@xcUl6XbI5@ZR63OTgAW7X5oXOAIgcniUCKa4qbK8Kc/G9yXrIYop8SpHHMyOtCzUU0smdvbDkkwiP0BywKQA9RHgWw/Zs0oAsXC34BX4Guupa334Y@QNL5F6vZVeLwf/bRgwcNtXuYAo533scfcmTA3gaGd8SEl1/05uhsj2phjS8fLlTWKcnkW9@6D9NHqAhYlXCBqJGn2ukqLs8@tZ1JUl1I2foepq6vA2RaRniAQdr6L3K5mD/vRsejWmWqSm/F/1Ord2k5r0p6YOrb0BADMz4ZKCX6jv6QPn0WHgbeoSj4zH/MppEjInVyb0lVM/WY5h3e9Zzhqw1DI72kKJOrSfdHCtdqubV9oXpll9ja/9LSiPB5Y8AIJKEk/GF4B1YNZg00sCw3gxqDvoG1p8BwBNv5Y8ql@IDlMcKRWLySMnfj0gDt8XCgqE3W7euw2ACWHezO9De8sb38IeNpCbWvIdMXl9nmmbOR4QvfP60WtldXXDWJDNAzxywPQjpwpv0gfyelleoPMMOsT39MbPSkHekoijLWgToA/9f73jknm75VG84JJ9uyWxS/83b7T89F2Wv76oXn6F5Z2XV957bSX91sov31cRb6osv6giXlERt/3lYfYKPno16x9exEfnHuiyciJh3fClMFGx/kPuGqZkqTneSUVMJs7dCNpLege@xl9F5dW9wlWUemuCE4JD8/gB54N2GeRBdUzsAN@6Q8WIHhabWqnjM3xXInyTsnFxYp01vqcCBUKIr3ur8nFbU0n45uKZYdbqZ7q5i7cWol/EXV@VOoeGVZFdJCOQHA7OpLFYneFVh/LKTAQslNiOjN8QzG0fqnW9RV5C@738WSU1sgkO/oFs/x8" rel="nofollow noreferrer" title="yash – Try It Online">Try it online!</a></p>
<h2>Usage</h2>
<ul>
<li>With STDIN and STDOUT.</li>
<li>Each integer shall be given, separated by one or more space characters.</li>
<li>Outputted separated with a space.</li>
</ul>


blocks|key|1266618|text|椰子，48字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1266619|l->(l[1::2],l[:-1:2])%7C*>zip%7C>reduce$(%2B)|code-block|syntax|javascript|1266620|在网上试试！|unstyled|1266621|Python等效：|1266622|from+functools+import+reduce
from+operator+import+add
f+=+lambda+l:+reduce(add,+zip(l[1::2],+l[:-1:2]))|entityMap|0|LINK|mutability|MUTABLE|url|http://coconut-lang.org/|1|https://tio.run/##S85Pzs8rLfmfZhvzP0fXTiMn2tDKyihWJyfaStcQyNCs0bKryiyosStKTSlNTlXR0Nb8X1CUmVeikaYRbaijYKSjYKyjYKKjYKqjYBarqfkfAA^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="http://coconut-lang.org/" rel="nofollow noreferrer">Coconut</a>, 48 bytes</h1>
<pre><code>l-&gt;(l[1::2],l[:-1:2])|*&gt;zip|&gt;reduce$(+)
</code></pre>
<p><a href="https://tio.run/##S85Pzs8rLfmfZhvzP0fXTiMn2tDKyihWJyfaStcQyNCs0bKryiyosStKTSlNTlXR0Nb8X1CUmVeikaYRbaijYKSjYKyjYKKjYKqjYBarqfkfAA" rel="nofollow noreferrer" title="Coconut – Try It Online">Try it online!</a></p>
<p>Python equivalent:</p>
<pre class="lang-python prettyprint-override"><code>from functools import reduce
from operator import add
f = lambda l: reduce(add, zip(l[1::2], l[:-1:2]))
</code></pre>


blocks|key|1266688|text|C%2B%2B+(gcc)，50字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1266689|[](auto&v){for(int&i:v)swap(i,(&i)[int(&i)%258<1]);}|code-block|syntax|javascript|1266690|-感谢天花板猫的5个字节！|unstyled|1266691|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://gcc.gnu.org/|1|https://tio.run/##RY/BbsIwEETv/ooRVaO4OAcoBUoCP5LmYBkntUScyHbMIcqv17WhUvewO/u0mtGKcSw6IcKL0uI2XSUqNVhnJO8v5J95KdxgLoRMVukOmvfSjlxIWHctCVHaoedK50lw0wkG8c3NW9K@biiZCWI9XeBnbBi2DO8MO4YPhj3DgeHI8Ikl2qVbPrkBLc4IdZOnJfN0bgeTIjJ18tTe@ZgrlmeK1pGl@XqsNg0tl/Dn0eaelk8VYx8uUDjB0wdMJYbJoaoijm31pVclWcKPaG@8s6G4hyI@eBbr9ZaHoh2l6ZW1ystf^0|0|9|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://gcc.gnu.org/" rel="nofollow noreferrer">C++ (gcc)</a>, 50 bytes</h1>

<pre class="lang-cpp prettyprint-override"><code>[](auto&amp;v){for(int&amp;i:v)swap(i,(&amp;i)[int(&amp;i)%8&lt;1]);}
</code></pre>
<p>-5 bytes thanks to ceilingcat!</p>
<p><a href="https://tio.run/##RY/BbsIwEETv/ooRVaO4OAcoBUoCP5LmYBkntUScyHbMIcqv17WhUvewO/u0mtGKcSw6IcKL0uI2XSUqNVhnJO8v5J95KdxgLoRMVukOmvfSjlxIWHctCVHaoedK50lw0wkG8c3NW9K@biiZCWI9XeBnbBi2DO8MO4YPhj3DgeHI8Ikl2qVbPrkBLc4IdZOnJfN0bgeTIjJ18tTe@ZgrlmeK1pGl@XqsNg0tl/Dn0eaelk8VYx8uUDjB0wdMJYbJoaoijm31pVclWcKPaG@8s6G4hyI@eBbr9ZaHoh2l6ZW1ystf" rel="nofollow noreferrer" title="C++ (gcc) – Try It Online">Try it online!</a></p>


blocks|key|1263802|text|外壳，4字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1263803|ṁ↔C2|code-block|syntax|javascript|1263804|在网上试试！|unstyled|1263805|解释|1263806|ṁ↔C2
++C2++slices+of+length+2
ṁ↔++++flatmap+reverse|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/barbuz/Husk|1|https://tio.run/##yygtzv7//@HOxkdtU5yN/v//H22gY6hjpGOsY6JjqmOmY65joWMZCwA^0|0|2|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/barbuz/Husk" rel="nofollow noreferrer">Husk</a>, 4 bytes</h1>
<pre><code>ṁ↔C2
</code></pre>
<p><a href="https://tio.run/##yygtzv7//@HOxkdtU5yN/v//H22gY6hjpGOsY6JjqmOmY65joWMZCwA" rel="nofollow noreferrer" title="Husk – Try It Online">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>ṁ↔C2
  C2  slices of length 2
ṁ↔    flatmap reverse
</code></pre>


blocks|key|1267112|text|sed+-n，10字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1267113|2~2{G;p};h|code-block|syntax|javascript|1267114|在网上试试！|unstyled|1267115|用于偶数行的2~2{G;p}，在模式空间中附加保持空间并打印|unordered-list-item|1267116|h对所有行，用模式空间替换持有空间。这意味着当我们在偶数行上时，保持空间总是包含前面的奇数行。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/sed/|1|https://tio.run/##K05N0U3PK/3/36jOqNrduqDWOuP/f0MDAy5DA0MgNgJiYyA2AWLTf/kFJZn5ecX/dfMA^0|4|2|0|3|0|0|0|0|6|1|0|6|8|0|0|1^^$0|@$1|2|3|4|5|6|7|11|8|@$9|12|A|13|B|C]]|D|@$9|14|A|15|1|16]]|E|$]]|$1|F|3|G|5|H|7|17|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|18|8|@]|D|@$9|19|A|1A|1|1B]]|E|$]]|$1|N|3|O|5|P|7|1C|8|@$9|1D|A|1E|B|C]]|D|@]|E|$]]|$1|Q|3|R|5|P|7|1F|8|@$9|1G|A|1H|B|C]]|D|@]|E|$]]]|S|$T|$5|U|V|W|E|$X|Y]]|Z|$5|U|V|W|E|$X|10]]]]

<h1><a href="https://www.gnu.org/software/sed/" rel="nofollow noreferrer">sed</a> <code>-n</code>, 10 bytes</h1>
<pre><code>2~2{G;p};h
</code></pre>
<p><a href="https://tio.run/##K05N0U3PK/3/36jOqNrduqDWOuP/f0MDAy5DA0MgNgJiYyA2AWLTf/kFJZn5ecX/dfMA" rel="nofollow noreferrer" title="sed – Try It Online">Try it online!</a></p>
<ul>
<li><code>2~2{G;p}</code> For even numbered lines, append hold space into pattern space and print</li>
<li><code>h</code> For all lines, replace hold space with pattern space.  This means that the hold space will always contain the previous, odd-numbered line when we are on an even-numbered line.</li>
</ul>


blocks|key|1267172|text|布氏对数，5字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1267173|ġ₂↔ᵐc|code-block|syntax|javascript|1267174|在网上试试！|unstyled|1267175|解释|1267176|ġ₂+++++++++Split+the+list+in+groups+of+2+consecutive+elements
++↔ᵐ+++++++Map+reverse
++++c++++++Concatenate|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/JCumin/Brachylog|1|https://tio.run/##SypKTM6ozMlPN/r//8jCR01Nj9qmPNw6Ifn//2hDHSMdYx0THVMds9j/UQA^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>, 5 bytes</h1>
<pre><code>ġ₂↔ᵐc
</code></pre>
<p><a href="https://tio.run/##SypKTM6ozMlPN/r//8jCR01Nj9qmPNw6Ifn//2hDHSMdYx0THVMds9j/UQA" rel="nofollow noreferrer" title="Brachylog – Try It Online">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>ġ₂         Split the list in groups of 2 consecutive elements
  ↔ᵐ       Map reverse
    c      Concatenate
</code></pre>


blocks|key|1264412|text|骑士，35字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264413|;=aP;=bP+WaIb;Ob;Oa;=bN=aP+Ia=bP=aP|code-block|syntax|javascript|1264414|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/knight-lang/knight-lang|1|https://tio.run/##lVhrc9NGFP2eX6GoNNZaiuJQSgcrSgbS0Mm0OClJy7S2wavV2hbIktEjCbXVv07vXb1WfoXOMIy1e/a@9tzH5iO9ozGLvHlyGIQu/8p8GsfKr4E3mSYXURRGCn9IeODGivhaZDngmkYxb@5LZ0rU2zRIvNnjuJsk4nS2YGEQJ1HKkjDSKFkkUy824zCNGLdpBjve/N3US3g8p4xrxf6MJmyqHb3X@oPhoD@IYT3rDvXld/33g2DY1gbB8gkh7SOSzTn/BLsRT9IoUCTh/c5wuQxS389yYY7B7A5Z@DxRqO2Y/IEzTYITqxCBR2zbpmf4oytDbOm3GacO2K5RUGP6PJgkU2LQPhuSLAnBcS@YbLQqy0Q4lNu/ri9u7P7QykP1J/VTvogTmnhMmeMtaA5ZOOZaeKwxRPGORuBDx6InQkyh36K6nvvHbLHep0OzlGV5Y42Rwh6WSb5mURqIsEfhvRLw@5wRmcuddLJhfYt3QohZbwKul84cHm3BlZuAexWGPqfBFmC1mxWs@g2CEVG/Il4euhWSxekcpRtC1AeXJhS4ljsqKdngTPFdn9vkSfHdBK25US7IMP7ZR/MKBFU8sJoGjIfj3GvJjYMDyXjgY/6rjAIKr0JQhGSNPyXX62y6fT0k/ZeHfw/bR8ZxRXl6cIAXjDI19VZFbSRz09m8cmZUOvNE5GdGRpmfTGtX9mtbDw5o49omMk6RcftNYJaTeZ7GUw1XiZWnykXvz8u3V703F71be5EVCXPp8iBZ4cBj7vfp4T8fhvh/5/DFBwjBagCEUDA228UmD0HApmZ8xFFv7AEuD1GOw0CBud4kQDmSJ/0aM6yomRu8BYUZfBd6rtLZx/spLbfqBJXrsjb6I/gUhPeB4lWWKa2Gaa1RM@bCBVLGV4rut9Jr4OrrIYWAFulCySqpio2aU9R1Ja6U52vO6FQqHSSDGrwTftiEz1J/J7zdhLvenexlvYU30biEUtQbmkxN4E3AJKlH4Pe2S1LPaRCEiQKq4E4U54vyD49CFUwN3f@pu1b4PX1UH4hP/VDSNw/vd@urxS@X@xo96ZBvcr7d/gbv@cM8DJCkNOHCICUJoTYGfAJ8u@MKGMcjMNLfUklO5HvbWm9OG6gG8Wva96Ah7ua9VL0r4veKkkpyzqOQRgkpKwi225UcUBGsEXVXZxDyCucfCSULZ2AmF0dMtQrG/zwlBwfXyuhAc3w0OEghx6ZSz1FbQwJzXDy4GbbPyOD4yHgqaIXRAGY5MpFAAw4r@RBDzXy4Q7DawrbElsuW2sIfpHapHlqx6IFVMy8AJrnK5zQEQvGAhSkuc7erPFnQbLSppQv7m3lkHHfIctlZqVnFgLCrZqETowJQKFwvPQiqdZkRn3MKvUeuQI8wvhq1djK@QsmXCotFd4VT1L35ErAuzeyIf069iGvqOFaJscARWWw50haber77YR6FjMeIev1H7/z28qp3U/fm11ADdrVmiSX5BcNkXonpO1KnEzctzaqWxKuzrsg6fWmSo5wxHOdpnI/xw4X52D1h5WzslrPx2BYWmaUpqGx/vIVObzzo3cFEodEkneHA8WTh6seZAkqUMXoJHdXBRmrxPLBjkkl3jIHQmOEYfGWkgCW2MlagOJvmvwM647aT/wbVsc3WZ1dxQDNNs0JVlSWv4ipqT7ww0FS9klqFx1HKkVMcpbqtGoqqO2Yuo@riurpWm66cj5wlphcL/howLmXjQpUS8YkXJ1y4SBYQ2mPsVeUDaeUtoak9MEmZpTDkOZCoD5Ql/hcFeoHCpjSCL5hZ/DCYQE2yaoLQoe1IGiEwVeeSr7ZIMniBao6UB0SuPfUYlb83rI00UHuhcoeSoVCmvou2ChXuPtRKKasw4MSoQqBeq4ZG7NPiSaaqhmO/SsdjHpnU90OmwQDuhhgkqnWAER2YyA2gvANPSuKA4Z8spoOr95BxXDuGLix2xEvOxNx650Hiq4NAJYTZzIx9D16IHUM5rCf7stIwksmWvc0ta7TusR@Cr8@evnj24vlPT188b4vViAZuOMOwyecvVIPapxgy2ghtDWm9bCGkSvQ8vIVVjtzdwICz0sxckjmOwtk5MOA8dGHQLN5OpFuaK1@nyQrcywRnNtnIV8JIKi@d50vF41L8L2@PxHbVh5rObXFU/V0cKgqiyR@81SouYfcrBeKt1XwANZC/VUj0WDakTCYZ/TNy67Qa3xrBLi2LEzdME/M@gsYNAvM8JwZtxOyqKajWWkhTBwPxPCz//AFUO9uioEB0jDL9AUu6G8Ej7JJ7I2JU05Nskw5kxXJSXxy23MLLRhgO15D4QtiEbK8hsUNvQh6tIcW7YAPy@3WZ4WY7368hxfy9AXlSISvSlEdwNqiOyGdOt5@ZbDtztv0MFv@NZw6qMxotM7zxF5uz4li3kYPLR4/RrrOem5Z0LN81NgXMlmCNKoOP2@USVEoP/WZKU7N4qTt2pd9pCH9XCV9gH7Ua6WuRlcTbSObLXAS0f/uUbgwWW/f9F@mQCFptt@E0nmsGNgLps6xlVTqikOVSVZtRuykUuEJFeegRVa7trmuuwGXW44B/RnWYL@uK4BCd6bVJuotduW4d/7bk2td8xAMOojP6atn02rKda@UdvXSsK/hH4bMHq8olVK5r@PF1BM9RD3uX9fV47@neD3vP9n7ce773Hw^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/knight-lang/knight-lang" rel="nofollow noreferrer">Knight</a>, 35 bytes</h1>
<pre><code>;=aP;=bP WaIb;Ob;Oa;=bN=aP Ia=bP=aP
</code></pre>
<p><a href="https://tio.run/##lVhrc9NGFP2eX6GoNNZaiuJQSgcrSgbS0Mm0OClJy7S2wavV2hbIktEjCbXVv07vXb1WfoXOMIy1e/a@9tzH5iO9ozGLvHlyGIQu/8p8GsfKr4E3mSYXURRGCn9IeODGivhaZDngmkYxb@5LZ0rU2zRIvNnjuJsk4nS2YGEQJ1HKkjDSKFkkUy824zCNGLdpBjve/N3US3g8p4xrxf6MJmyqHb3X@oPhoD@IYT3rDvXld/33g2DY1gbB8gkh7SOSzTn/BLsRT9IoUCTh/c5wuQxS389yYY7B7A5Z@DxRqO2Y/IEzTYITqxCBR2zbpmf4oytDbOm3GacO2K5RUGP6PJgkU2LQPhuSLAnBcS@YbLQqy0Q4lNu/ri9u7P7QykP1J/VTvogTmnhMmeMtaA5ZOOZaeKwxRPGORuBDx6InQkyh36K6nvvHbLHep0OzlGV5Y42Rwh6WSb5mURqIsEfhvRLw@5wRmcuddLJhfYt3QohZbwKul84cHm3BlZuAexWGPqfBFmC1mxWs@g2CEVG/Il4euhWSxekcpRtC1AeXJhS4ljsqKdngTPFdn9vkSfHdBK25US7IMP7ZR/MKBFU8sJoGjIfj3GvJjYMDyXjgY/6rjAIKr0JQhGSNPyXX62y6fT0k/ZeHfw/bR8ZxRXl6cIAXjDI19VZFbSRz09m8cmZUOvNE5GdGRpmfTGtX9mtbDw5o49omMk6RcftNYJaTeZ7GUw1XiZWnykXvz8u3V703F71be5EVCXPp8iBZ4cBj7vfp4T8fhvh/5/DFBwjBagCEUDA228UmD0HApmZ8xFFv7AEuD1GOw0CBud4kQDmSJ/0aM6yomRu8BYUZfBd6rtLZx/spLbfqBJXrsjb6I/gUhPeB4lWWKa2Gaa1RM@bCBVLGV4rut9Jr4OrrIYWAFulCySqpio2aU9R1Ja6U52vO6FQqHSSDGrwTftiEz1J/J7zdhLvenexlvYU30biEUtQbmkxN4E3AJKlH4Pe2S1LPaRCEiQKq4E4U54vyD49CFUwN3f@pu1b4PX1UH4hP/VDSNw/vd@urxS@X@xo96ZBvcr7d/gbv@cM8DJCkNOHCICUJoTYGfAJ8u@MKGMcjMNLfUklO5HvbWm9OG6gG8Wva96Ah7ua9VL0r4veKkkpyzqOQRgkpKwi225UcUBGsEXVXZxDyCucfCSULZ2AmF0dMtQrG/zwlBwfXyuhAc3w0OEghx6ZSz1FbQwJzXDy4GbbPyOD4yHgqaIXRAGY5MpFAAw4r@RBDzXy4Q7DawrbElsuW2sIfpHapHlqx6IFVMy8AJrnK5zQEQvGAhSkuc7erPFnQbLSppQv7m3lkHHfIctlZqVnFgLCrZqETowJQKFwvPQiqdZkRn3MKvUeuQI8wvhq1djK@QsmXCotFd4VT1L35ErAuzeyIf069iGvqOFaJscARWWw50haber77YR6FjMeIev1H7/z28qp3U/fm11ADdrVmiSX5BcNkXonpO1KnEzctzaqWxKuzrsg6fWmSo5wxHOdpnI/xw4X52D1h5WzslrPx2BYWmaUpqGx/vIVObzzo3cFEodEkneHA8WTh6seZAkqUMXoJHdXBRmrxPLBjkkl3jIHQmOEYfGWkgCW2MlagOJvmvwM647aT/wbVsc3WZ1dxQDNNs0JVlSWv4ipqT7ww0FS9klqFx1HKkVMcpbqtGoqqO2Yuo@riurpWm66cj5wlphcL/howLmXjQpUS8YkXJ1y4SBYQ2mPsVeUDaeUtoak9MEmZpTDkOZCoD5Ql/hcFeoHCpjSCL5hZ/DCYQE2yaoLQoe1IGiEwVeeSr7ZIMniBao6UB0SuPfUYlb83rI00UHuhcoeSoVCmvou2ChXuPtRKKasw4MSoQqBeq4ZG7NPiSaaqhmO/SsdjHpnU90OmwQDuhhgkqnWAER2YyA2gvANPSuKA4Z8spoOr95BxXDuGLix2xEvOxNx650Hiq4NAJYTZzIx9D16IHUM5rCf7stIwksmWvc0ta7TusR@Cr8@evnj24vlPT188b4vViAZuOMOwyecvVIPapxgy2ghtDWm9bCGkSvQ8vIVVjtzdwICz0sxckjmOwtk5MOA8dGHQLN5OpFuaK1@nyQrcywRnNtnIV8JIKi@d50vF41L8L2@PxHbVh5rObXFU/V0cKgqiyR@81SouYfcrBeKt1XwANZC/VUj0WDakTCYZ/TNy67Qa3xrBLi2LEzdME/M@gsYNAvM8JwZtxOyqKajWWkhTBwPxPCz//AFUO9uioEB0jDL9AUu6G8Ej7JJ7I2JU05Nskw5kxXJSXxy23MLLRhgO15D4QtiEbK8hsUNvQh6tIcW7YAPy@3WZ4WY7368hxfy9AXlSISvSlEdwNqiOyGdOt5@ZbDtztv0MFv@NZw6qMxotM7zxF5uz4li3kYPLR4/RrrOem5Z0LN81NgXMlmCNKoOP2@USVEoP/WZKU7N4qTt2pd9pCH9XCV9gH7Ua6WuRlcTbSObLXAS0f/uUbgwWW/f9F@mQCFptt@E0nmsGNgLps6xlVTqikOVSVZtRuykUuEJFeegRVa7trmuuwGXW44B/RnWYL@uK4BCd6bVJuotduW4d/7bk2td8xAMOojP6atn02rKda@UdvXSsK/hH4bMHq8olVK5r@PF1BM9RD3uX9fV47@neD3vP9n7ce773Hw" rel="nofollow noreferrer" title="JavaScript (Node.js) – Try It Online">Try it online!</a></p>


blocks|key|1267266|text|rSNBATWPL，37字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1267267|a~(a+cond+(a{1},0+a)%2B{a+sfro+2}){%2Bfor|code-block|syntax|javascript|1267268|这是很棒的高尔夫球。这是“糟糕的rSNBATWPL”，因为它滥用了非常严重的语法。它的未镀金版本是：|unstyled|1267269|f+=+a+~+cond{a}+{
++++(a{1},+a{0})+conc+f{a+sfro+2}
}+{+cast.array{""}+}|1267270|这是一个简单的递归lambda函数，它逐对迭代.我为这做的一些高尔夫球是：|1267271|当然，删除空白和不必要的尾随}|unordered-list-item|style|CODE|1267272|用cast.array{""}代替%2Bfor，这是一种非常奇怪的生成空数组的方法(通过迭代一个函数(在本例中为%2B+)来迭代当for将其正确的输入(即Null+)转换到数组时生成的空数组)。|1267273|用conc替换%2B，这是concat函数|1267274|将a{0}替换为0+a，后者将a作为一个咖喱二进制函数调用。它的第二个参数是Null，由于调用任何以Null为输入的函数的原语值时，返回值不变，因此节省了一个字节，成本很小。|1267275|将cond作为二进制函数运行。由于rSNBATWPL函数/内置程序是仓促运行的，这将节省一个字节，超过三次应用该函数(这是提供三个参数的传统方法)。|1267276|用隐式递归调用替换f=和f{...}。.是一个变量，它总是引用当前的函数，因此可以用.{...}替换f{...}以移除f=，每当没有函数名的{...}出现时，都会添加一个隐式.，允许我在%2B之后保存另一个字节|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Radvylf/rSNBATWPL^0|0|9|0|0|0|0|0|0|E|1|0|1|E|H|4|1I|1|1P|3|21|4|0|1|4|7|1|0|1|4|8|3|F|1|12|4|1E|4|0|1|4|0|9|2|C|6|J|1|16|6|1E|6|1N|2|1Y|5|2F|1|2L|1^^$0|@$1|2|3|4|5|6|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|D|3|E|5|F|7|1F|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1G|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|1H|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|1I|8|@]|9|@]|C|$]]|$1|P|3|Q|5|R|7|1J|8|@$A|1K|B|1L|S|T]]|9|@]|C|$]]|$1|U|3|V|5|R|7|1M|8|@$A|1N|B|1O|S|T]|$A|1P|B|1Q|S|T]|$A|1R|B|1S|S|T]|$A|1T|B|1U|S|T]|$A|1V|B|1W|S|T]]|9|@]|C|$]]|$1|W|3|X|5|R|7|1X|8|@$A|1Y|B|1Z|S|T]|$A|20|B|21|S|T]]|9|@]|C|$]]|$1|Y|3|Z|5|R|7|22|8|@$A|23|B|24|S|T]|$A|25|B|26|S|T]|$A|27|B|28|S|T]|$A|29|B|2A|S|T]|$A|2B|B|2C|S|T]]|9|@]|C|$]]|$1|10|3|11|5|R|7|2D|8|@$A|2E|B|2F|S|T]]|9|@]|C|$]]|$1|12|3|13|5|R|7|2G|8|@$A|2H|B|2I|S|T]|$A|2J|B|2K|S|T]|$A|2L|B|2M|S|T]|$A|2N|B|2O|S|T]|$A|2P|B|2Q|S|T]|$A|2R|B|2S|S|T]|$A|2T|B|2U|S|T]|$A|2V|B|2W|S|T]|$A|2X|B|2Y|S|T]]|9|@]|C|$]]]|14|$15|$5|16|17|18|C|$19|1A]]]]

<h1><a href="https://github.com/Radvylf/rSNBATWPL" rel="nofollow noreferrer">rSNBATWPL</a>, 37 bytes</h1>
<pre><code>a~(a cond (a{1},0 a)+{a sfro 2}){+for
</code></pre>
<p>This is very golfed. It is &quot;bad rSNBATWPL&quot; in that it abuses the syntax very heavily. The ungolfed version of this is:</p>
<pre><code>f = a ~ cond{a} {
    (a{1}, a{0}) conc f{a sfro 2}
} { cast.array{&quot;&quot;} }
</code></pre>
<p>This is a simple recursive lambda function, which iterates pair-by-pair. Some golfs I made to this were:</p>
<ul>
<li>Removing whitespace and the unnecessary trailing <code>}</code>, of course</li>
<li>Substituting <code>cast.array{&quot;&quot;}</code> for <code>+for</code>, a very strange way of generating an empty array (works by iterating with a function, <code>+</code> in this case, over an empty array generated when <code>for</code> casts its right input, which is <code>Null</code>, to an array)</li>
<li>Replacing <code>conc</code>, the concat function, with <code>+</code></li>
<li>Replacing <code>a{0}</code> with <code>0 a</code>, which calls <code>a</code> as a curried binary function. Its second argument is <code>Null</code>, and since calling any primitive value as a function with <code>Null</code> as its input returns it unchanged, this saves a byte for little cost</li>
<li>Running <code>cond</code> as a binary function. Since rSNBATWPL functions/built-ins are curried, this saves a byte over applying the function three times (which is the traditional way of providing three arguments)</li>
<li>Replacing <code>f=</code> and <code>f{...}</code> with an implicit recursive call. <code>.</code> is a variable which always refers to the current function, so <code>f{...}</code> can be replaced with <code>.{...}</code> to remove the <code>f=</code>, and any time there's a <code>{...}</code> without a function name, an implicit <code>.</code> is added, allowing me to save another byte by putting it after the <code>+</code></li>
</ul>


blocks|key|1267308|text|图诺，6+\log_{256}(96)+\approx++4.94字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1267309|ZlrzZS|code-block|syntax|javascript|1267310|在网上试试！|unstyled|1267311|解释|1267312|ZlrzZS++#+Implicit+input+++++[1,+2,+3,+4,+5,+6]
Zl++++++#+Uninterleave+++++++[[1,+3,+5],+[2,+4,+6]]
++r+++++#+Reverse++++++++++++[[2,+4,+6],+[1,+3,+5]]
+++zZ+++#+Zip++++++++++++++++[[2,+1],+[4,+3],+[6,+5]]
+++++S++#+Sum+(Flatten)++++++[2,+1,+4,+3,+6,+5]|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Thunno/Thunno|1|INLINETEX|IMMUTABLE|teX|6+\log_{256}(96)+\approx+|2|https://ato.pxeger.com/run?1=m72sJKM0Ly9_wYKlpSVpuhbLonKKqqKCIRyo2IJN0YY6CkY6CsY6CiY6CqY6CmaxEBkA^0|3|P|0|2|0|3|P|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|6|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/Thunno/Thunno" rel="nofollow noreferrer">Thunno</a>, <span class="math-container">\$ 6 \log_{256}(96) \approx \$</span> 4.94 bytes</h1>
<pre><code>ZlrzZS
</code></pre>
<p><a href="https://ato.pxeger.com/run?1=m72sJKM0Ly9_wYKlpSVpuhbLonKKqqKCIRyo2IJN0YY6CkY6CsY6CiY6CqY6CmaxEBkA" rel="nofollow noreferrer">Attempt This Online!</a></p>
<h4>Explanation</h4>
<pre class="lang-python prettyprint-override"><code>ZlrzZS  # Implicit input     [1, 2, 3, 4, 5, 6]
Zl      # Uninterleave       [[1, 3, 5], [2, 4, 6]]
  r     # Reverse            [[2, 4, 6], [1, 3, 5]]
   zZ   # Zip                [[2, 1], [4, 3], [6, 5]]
     S  # Sum (Flatten)      [2, 1, 4, 3, 6, 5]
</code></pre>


blocks|key|1264211|text|皮斯，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264212|.n_McQ2|code-block|syntax|javascript|1264213|在网上试试！|unstyled|1264214|计算输入的cQ2块，长度为2|unordered-list-item|style|CODE|1264215|_M映射块矩阵中的过反转|1264216|.n使它变平|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/isaacg1/pyth|1|https://tio.run/##K6gsyfj/Xy8v3jc50Oj//2hDHSMdYx0THVMds1gA^0|0|2|0|0|0|0|6|1|0|5|3|0|0|2|0|0|2^^$0|@$1|2|3|4|5|6|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|D|3|E|5|F|7|17|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|18|8|@]|9|@$A|19|B|1A|1|1B]]|C|$]]|$1|L|3|M|5|N|7|1C|8|@$A|1D|B|1E|O|P]]|9|@]|C|$]]|$1|Q|3|R|5|N|7|1F|8|@$A|1G|B|1H|O|P]]|9|@]|C|$]]|$1|S|3|T|5|N|7|1I|8|@$A|1J|B|1K|O|P]]|9|@]|C|$]]]|U|$V|$5|W|X|Y|C|$Z|10]]|11|$5|W|X|Y|C|$Z|12]]]]

<h1><a href="https://github.com/isaacg1/pyth" rel="nofollow noreferrer">Pyth</a>, 7 bytes</h1>
<pre><code>.n_McQ2
</code></pre>
<p><a href="https://tio.run/##K6gsyfj/Xy8v3jc50Oj//2hDHSMdYx0THVMds1gA" rel="nofollow noreferrer" title="Pyth – Try It Online">Try it online!</a></p>
<ul>
<li><p><code>cQ2</code> chunks of evaluated input in length of 2</p>
</li>
<li><p><code>_M</code> maps over reversal in the chunk matrix</p>
</li>
<li><p><code>.n</code> flattens it</p>
</li>
</ul>


blocks|key|1261220|text|木炭，5字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1261221|ＷＳ⟦Ｓι|code-block|syntax|javascript|1261222|在网上试试！链接是详细的代码版本。接受换行符结束的输入。解释：|unstyled|1261223|ＷＳ|1261224|在还有输入时重复..。|1261225|⟦Ｓι|1261226|..。输出前面的后续输入。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/somebody1234/Charcoal|1|https://tio.run/##S85ILErOT8z5/788IzMnVUHDM6@gtCS4pCgzL11DU1MhAMgo0YhGEdVRyIzVtP7/35DLiMuYy4TLlMuM679uWQ4A^0|0|2|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|F|7|1B|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|1C|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1D|8|@]|9|@]|C|$G|H]]|$1|R|3|S|5|K|7|1E|8|@]|9|@]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]]]

<h1><a href="https://github.com/somebody1234/Charcoal" rel="nofollow noreferrer">Charcoal</a>, 5 bytes</h1>
<pre><code>ＷＳ⟦Ｓι
</code></pre>
<p><a href="https://tio.run/##S85ILErOT8z5/788IzMnVUHDM6@gtCS4pCgzL11DU1MhAMgo0YhGEdVRyIzVtP7/35DLiMuYy4TLlMuM679uWQ4A" rel="nofollow noreferrer" title="Charcoal – Try It Online">Try it online!</a> Link is to verbose version of code. Takes newline-terminated input. Explanation:</p>
<pre><code>ＷＳ
</code></pre>
<p>Repeat while there is still input...</p>
<pre><code>⟦Ｓι
</code></pre>
<p>... output the subsequent input before it.</p>


blocks|key|1265145|text|Pip+-rp，7字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1265146|WVRVUWg|code-block|syntax|javascript|1265147|在网上试试！|unstyled|1265148|解释|1265149|标志用于输入和输出格式：-r从stdin行读取程序参数；-p将输出格式化为列表，而不是连接它。|1265150|++++++g++List+of+arguments
++++UW+++Unweave+into+a+pair+of+lists,+each+consisting+of+every+other+element
++RV+++++Reverse+the+order+of+those+two+lists
WV+++++++Weave+them+back+together|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/dloscutoff/pip|1|https://tio.run/##K8gs@P8/PCwoLDQ8/f9/Qy4jLmMuEy5TLjMuQwMuE6P/ukUFAA^0|4|3|0|3|0|0|0|0|6|1|0|0|C|2|S|2|0^^$0|@$1|2|3|4|5|6|7|12|8|@$9|13|A|14|B|C]]|D|@$9|15|A|16|1|17]]|E|$]]|$1|F|3|G|5|H|7|18|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|19|8|@]|D|@$9|1A|A|1B|1|1C]]|E|$]]|$1|N|3|O|5|6|7|1D|8|@]|D|@]|E|$]]|$1|P|3|Q|5|M|7|1E|8|@$9|1F|A|1G|B|C]|$9|1H|A|1I|B|C]]|D|@]|E|$]]|$1|R|3|S|5|H|7|1J|8|@]|D|@]|E|$I|J]]]|T|$U|$5|V|W|X|E|$Y|Z]]|10|$5|V|W|X|E|$Y|11]]]]

<h1><a href="https://github.com/dloscutoff/pip" rel="nofollow noreferrer">Pip</a> <code>-rp</code>, 7 bytes</h1>
<pre><code>WVRVUWg
</code></pre>
<p><a href="https://tio.run/##K8gs@P8/PCwoLDQ8/f9/Qy4jLmMuEy5TLjMuQwMuE6P/ukUFAA" rel="nofollow noreferrer" title="Pip – Try It Online">Try it online!</a></p>
<h3>Explanation</h3>
<p>The flags are for input &amp; output formatting: <code>-r</code> reads the program arguments from lines of stdin; <code>-p</code> formats the output as a list rather than concatenating it.</p>
<pre><code>      g  List of arguments
    UW   Unweave into a pair of lists, each consisting of every other element
  RV     Reverse the order of those two lists
WV       Weave them back together
</code></pre>


blocks|key|1261829|text|CJam，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1261830|N{riripp}h|code-block|syntax|javascript|1261831|在网上试试！|unstyled|1261832|解释|1261833|N+++++++++++e#+Push+newline+(this+is+truthy)
+{++++++}h++e#+Do+while+without+popping+the+condition:+infinite+loop
++r+++++++++e#+Read+line+and+push+string+to+the+stack
+++i++++++++e#+Interpret+as+integer
++++r+++++++e#+Read+line+and+push+string+to+the+stack
+++++i++++++e#+Interpret+as+integer
++++++p+++++e#+Pop+and+print+with+a+newline
+++++++p++++e#+Pop+and+print+with+a+newline
++++++++++++e#+Implicitly+print+stack:+newline|entityMap|0|LINK|mutability|MUTABLE|url|https://sourceforge.net/p/cjam|1|https://tio.run/##S85KzP3/36@6KLMos6CgNuP/f0MuIy5jLhMuUy4zAA^0|0|4|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://sourceforge.net/p/cjam" rel="nofollow noreferrer">CJam</a>, 10 bytes</h1>
<pre><code>N{riripp}h
</code></pre>
<p><a href="https://tio.run/##S85KzP3/36@6KLMos6CgNuP/f0MuIy5jLhMuUy4zAA" rel="nofollow noreferrer" title="CJam – Try It Online">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>N           e# Push newline (this is truthy)
 {      }h  e# Do while without popping the condition: infinite loop
  r         e# Read line and push string to the stack
   i        e# Interpret as integer
    r       e# Read line and push string to the stack
     i      e# Interpret as integer
      p     e# Pop and print with a newline
       p    e# Pop and print with a newline
            e# Implicitly print stack: newline
</code></pre>


blocks|key|1262052|text|莫德芯，115个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1262053|mod+S+is+pr+LIST{Nat}.+op+f+:+Nat+~>+Nat+.+var+A+B+:+Nat+.+eq+f(A+B+X:[Nat])=
B+A+f(X:[Nat]).+eq+f(nil)=+nil+.+endm|code-block|syntax|javascript|1262054|该结果是通过减少输入列表的f函数来得到的。|unstyled|style|CODE|1262055|示例会话|1262056|Maude>+red+f(1+2+3+4+5+6)+.++---+Expected:+2+1+4+3+6+5
result+NeList{Nat}:+2+1+4+3+6+5
Maude>+red+f(0+1+0+1)+.++---+Expected:+1+0+1+0
result+NeList{Nat}:+1+0+1+0|1262057|Ungolfed|1262058|mod+S+is
++++pr+LIST{Nat}+.

++++op+f+:+Nat+~>+Nat+.

++++var+A+B+:+Nat+.

++++eq+f(A+B+X:[Nat])+=+B+A+f(X:[Nat])+.
++++eq+f(nil)+=+nil+.
endm|1262059|只是简单的递归解决方案。通过在X:[Nat]中内联类型而不是用var关键字声明类型，节省了几个字节。对A和B做同样的操作并不会改变字节计数--只是数学计算的方式。|entityMap|0|LINK|mutability|MUTABLE|url|http://maude.cs.illinois.edu/w/index.php/The_Maude_System^0|0|3|0|0|0|D|1|0|0|0|0|0|F|7|V|3|1F|1|1H|1^^$0|@$1|2|3|4|5|6|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]|$1|D|3|E|5|F|7|18|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|19|8|@$A|1A|B|1B|L|M]]|9|@]|C|$]]|$1|N|3|O|5|6|7|1C|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1D|8|@]|9|@]|C|$G|H]]|$1|R|3|S|5|6|7|1E|8|@]|9|@]|C|$]]|$1|T|3|U|5|F|7|1F|8|@]|9|@]|C|$G|H]]|$1|V|3|W|5|K|7|1G|8|@$A|1H|B|1I|L|M]|$A|1J|B|1K|L|M]|$A|1L|B|1M|L|M]|$A|1N|B|1O|L|M]]|9|@]|C|$]]]|X|$Y|$5|Z|10|11|C|$12|13]]]]

<h1><a href="http://maude.cs.illinois.edu/w/index.php/The_Maude_System" rel="nofollow noreferrer">Core Maude</a>, 115 bytes</h1>
<pre><code>mod S is pr LIST{Nat}. op f : Nat ~&gt; Nat . var A B : Nat . eq f(A B X:[Nat])=
B A f(X:[Nat]). eq f(nil)= nil . endm
</code></pre>
<p>The result is obtained by reducing the <code>f</code> function with the input list.</p>
<h3>Example Session</h3>
<pre><code>Maude&gt; red f(1 2 3 4 5 6) .  --- Expected: 2 1 4 3 6 5
result NeList{Nat}: 2 1 4 3 6 5
Maude&gt; red f(0 1 0 1) .  --- Expected: 1 0 1 0
result NeList{Nat}: 1 0 1 0
</code></pre>
<h3>Ungolfed</h3>
<pre><code>mod S is
    pr LIST{Nat} .

    op f : Nat ~&gt; Nat .

    var A B : Nat .

    eq f(A B X:[Nat]) = B A f(X:[Nat]) .
    eq f(nil) = nil .
endm
</code></pre>
<p>Just the straightforward recursive solution. Saved a couple bytes by inlining the type in <code>X:[Nat]</code> rather than declaring it with the <code>var</code> keyword. Doing the same with <code>A</code> and <code>B</code> doesn't change the byte count — just the way the math works out.</p>


blocks|key|1266313|text|图标，47字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1266314|procedure+f(L)
L[i:=1to*L+by+2]:=:L[i%2B1]&\z
end|code-block|syntax|javascript|1266315|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/gtownsend/icon|1|https://tio.run/##y0zOz/v/v6AoPzk1pbQoVSFNw0eTyyc608rWsCRfy0chqVLBKNbK1goopG0YqxZTxZWal4KkPjcxM09Dk0sBCBIVrGwVog11jHSMdUx0THXMYsHCaRqJEPnUstSiSoXyosySVA1FoBjIIAA^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/gtownsend/icon" rel="nofollow noreferrer">Icon</a>, 47 bytes</h1>
<pre><code>procedure f(L)
L[i:=1to*L by 2]:=:L[i+1]&amp;\z
end
</code></pre>
<p><a href="https://tio.run/##y0zOz/v/v6AoPzk1pbQoVSFNw0eTyyc608rWsCRfy0chqVLBKNbK1goopG0YqxZTxZWal4KkPjcxM09Dk0sBCBIVrGwVog11jHSMdUx0THXMYsHCaRqJEPnUstSiSoXyosySVA1FoBjIIAA" rel="nofollow noreferrer" title="Icon – Try It Online">Try it online!</a></p>


blocks|key|1266375|text|K+(oK)，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1266376|解决方案：|1266377|,/%7C:'0N+2#|code-block|syntax|javascript|1266378|在网上试试！|unstyled|1266379|解释：|1266380|,/%7C:'0N+2#+/+the+solution
+++++0N+2#+/+reshape+into+n+x+2+grid
++%7C:'++++++/+reverse+(%7C:)+each+(')
,/+++++++++/+flatten|1266381|Alternatives:|1266382|,/%2B%7C%2B0N+2#+-也是10个字节|unordered-list-item|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/JohnEarnest/ok|1|https://tio.run/##y9bNz/7/X0e/xkrdwE/BSNlQwUjBWMFEwVTB7P9/AA^0|0|6|0|0|0|0|0|6|1|0|0|0|0|0|A^^$0|@$1|2|3|4|5|6|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|D|3|E|5|6|7|1B|8|@]|9|@]|C|$]]|$1|F|3|G|5|H|7|1C|8|@]|9|@]|C|$I|J]]|$1|K|3|L|5|M|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|N|3|O|5|6|7|1H|8|@]|9|@]|C|$]]|$1|P|3|Q|5|H|7|1I|8|@]|9|@]|C|$I|J]]|$1|R|3|S|5|6|7|1J|8|@]|9|@]|C|$]]|$1|T|3|U|5|V|7|1K|8|@$A|1L|B|1M|W|X]]|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/JohnEarnest/ok" rel="nofollow noreferrer">K (oK)</a>, 10 bytes</h1>
<p><strong>Solution:</strong></p>
<pre><code>,/|:'0N 2#
</code></pre>
<p><a href="https://tio.run/##y9bNz/7/X0e/xkrdwE/BSNlQwUjBWMFEwVTB7P9/AA" rel="nofollow noreferrer" title="K (oK) – Try It Online">Try it online!</a></p>
<p><strong>Explanation:</strong></p>
<pre><code>,/|:'0N 2# / the solution
     0N 2# / reshape into n x 2 grid
  |:'      / reverse (|:) each (')
,/         / flatten
</code></pre>
<p><strong>Alternatives:</strong></p>
<ul>
<li><code>,/+|+0N 2#</code> - also <strong>10 bytes</strong></li>
</ul>


blocks|key|1264149|text|朱莉娅|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1264150|25字节|1264151|!x=x[1:end.%7C>i->i-(-1)%5Ei]|code-block|syntax|javascript|1264152|在网上试试！|unstyled|1264153|24字节|1264154|!x=x[(I=1:end).-(-1).%5EI]|entityMap|0|LINK|mutability|MUTABLE|url|https://julialang.org/|1|https://ato.pxeger.com/run?1=NY-9CsIwFIX3PEXEpYHb0h8rUklxzVIXnUKFgClWpJU2BQcfwt2lSx_CR-nbeJsqJOSe850DN-_h2t1K1Y-vszKKS0KpDCCECFYQwzrnqQwhQBHBGuIcJu6jgXdidgDf-o2-a2UcaXXEePo3piwaQHKypKqqzUU3tK50gnLx4A_pCB4kujpvd55wHTdgJ8HyoTOFu_nYgKXeMy1dPDZQ_vjISFE31BEZ7I8Hxqdf4C471ba6MXQhMs4REOzPhb6f3y8^0|0|3|0|0|0|0|0|6|1|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|6|7|14|8|@]|9|@]|C|$]]|$1|F|3|G|5|H|7|15|8|@]|9|@]|C|$I|J]]|$1|K|3|L|5|M|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]|$1|N|3|O|5|6|7|1A|8|@]|9|@]|C|$]]|$1|P|3|Q|5|H|7|1B|8|@]|9|@]|C|$I|J]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://julialang.org" rel="nofollow noreferrer">Julia</a></h1>
<h2>25 bytes</h2>
<pre><code>!x=x[1:end.|&gt;i-&gt;i-(-1)^i]</code></pre>
<p><a href="https://ato.pxeger.com/run?1=NY-9CsIwFIX3PEXEpYHb0h8rUklxzVIXnUKFgClWpJU2BQcfwt2lSx_CR-nbeJsqJOSe850DN-_h2t1K1Y-vszKKS0KpDCCECFYQwzrnqQwhQBHBGuIcJu6jgXdidgDf-o2-a2UcaXXEePo3piwaQHKypKqqzUU3tK50gnLx4A_pCB4kujpvd55wHTdgJ8HyoTOFu_nYgKXeMy1dPDZQ_vjISFE31BEZ7I8Hxqdf4C471ba6MXQhMs4REOzPhb6f3y8" rel="nofollow noreferrer">Attempt This Online!</a></p>
<h2>24 bytes</h2>
<pre><code>!x=x[(I=1:end).-(-1).^I]
</code></pre>


<h2>Challenge</h2>
<p>Let's have a list <code>L</code> of <code>n</code> elements. The task is to swap every two elements in this list.</p>
<h2>Constrains</h2>
<ul>
<li>the list <code>L</code> has at least two elements</li>
<li>size of the list <code>L</code> is a multiple of two (i.e. number of elements is even)</li>
</ul>
<h3>Example</h3>
<ul>
<li><p>input: <code>[1,2,3,4,5,6]</code></p>
</li>
<li><p>output: <code>[2,1,4,3,6,5]</code></p>
</li>
<li><p>input: <code>[0,1,0,1]</code></p>
</li>
<li><p>output: <code>[1,0,1,0]</code></p>
</li>
</ul>
<h2>Rules</h2>
<ul>
<li>this is <code>code-golf</code> challenge, so the shortest code wins</li>
<li><a href="https://codegolf.meta.stackexchange.com/questions/2419/default-for-code-golf-program-function-or-snippet/2422#2422">standard rules apply</a> for your answer with <a href="https://codegolf.meta.stackexchange.com/questions/2447/default-for-code-golf-input-output-methods/">default I/O rules</a>, so you are allowed to use stdin/stdout, functions/method with the proper parameters and return-type, full programs</li>
<li><a href="https://codegolf.meta.stackexchange.com/questions/1061/loopholes-that-are-forbidden-by-default">default Loopholes</a> are forbidden.</li>
</ul>


Swap every two elements in a list

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

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

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

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

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

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

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

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

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

功能4上新

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

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

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

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

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

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

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

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

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

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

社区新版编辑器体验调研

挑战让我们有一个列表L的n元素。任务是交换此列表中的每两个元素。约束列表L至少有两个元素列表L的大小是两个的倍数(即元素数为偶数)。示例输入：[1,2,3,4,5,6]输出：[2,1,4,3,6,5]输入：[0,1,0,1]输出：[1,0,1,0]规则这是code-golf挑战，所以最短的代码赢了适用标准规则作为默认I/O规则的答案，因此您可以使用stdin/stdout、函数/方法和适当的参数以

问交换列表中的每两个元素
EN

挑战

约束

示例

规则

回答 47

Code Golf用户

Python 3，34字节

Code Golf用户

维沙尔 `r`，2字节

Code Golf用户

哈斯克尔，22字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问交换列表中的每两个元素EN

挑战

约束

示例

规则

回答 47

Code Golf用户

Python 3，34字节

Code Golf用户

维沙尔 r，2字节

Code Golf用户

哈斯克尔，22字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问交换列表中的每两个元素
EN

维沙尔 `r`，2字节