blocks|key|1033821|text|Python+3，26字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1033822|lambda+s:ord(s[-1])*2%2519%254|code-block|syntax|javascript|1033823|在网上试试！|unstyled|1033824|1033825|f(x)+=+(2x+\bmod+19)+\bmod+4+|atomic|style|CODE|mathjax|teX|f(x)+=+(2x+\bmod+19)+\bmod+4+|1033826|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##K6gsycjPM/6fpmCrEPM/JzE3KSVRodgqvyhFozha1zBWU8tI1dBS1eR/am5@SWZyfl4xUGE0l4KCkpWuhpIOmFEDpTWhtK6LElcsF1dafpFCqkJmngJcqxVQuqAoM69EI00jVVPzPwA^0|0|8|0|0|0|0|6|1|0|0|0|T|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|-4|5|K|7|1D|8|@]|9|@]|C|$]]|$1|M|3|N|5|O|7|1E|8|@$A|1F|B|1G|P|Q]]|9|@]|C|$R|-1|S|T]]|$1|U|3|-4|5|K|7|1H|8|@]|9|@]|C|$]]]|V|$W|$5|X|Y|Z|C|$10|11]]|12|$5|X|Y|Z|C|$10|13]]]]

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



<pre class="lang-python prettyprint-override"><code>lambda s:ord(s[-1])*2%19%4
</code></pre>

<p><a href="https://tio.run/##K6gsycjPM/6fpmCrEPM/JzE3KSVRodgqvyhFozha1zBWU8tI1dBS1eR/am5@SWZyfl4xUGE0l4KCkpWuhpIOmFEDpTWhtK6LElcsF1dafpFCqkJmngJcqxVQuqAoM69EI00jVVPzPwA" rel="noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>

<p><span class="math-container">$$ f(x) = (2x \bmod 19) \bmod 4 $$</span></p>


blocks|key|1033969|text|红宝石，20字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1033970|s[-1].ord将给出字符串中最后一个字符的代码点，然后我们可以插入这个公式：|unstyled|style|CODE|1033971|1033972|(160+\bmod+c)+\bmod+7+|atomic|mathjax|teX|(160+\bmod+c)+\bmod+7+|1033973|1033974|->s{160%25s[-1].ord%257}|code-block|syntax|javascript|1033975|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://www.ruby-lang.org/|1|https://tio.run/##KypNqvyfZvtf16642tDMQLU4WtcwVi@/KEXVvPZ/QWlJsUJatJKVhlIsF5xTg8zRROa4IHN0UTTpoujSRdGmC9T3HwA^0|0|3|0|0|0|9|0|0|0|M|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]|$1|D|3|E|5|F|7|1A|8|@$A|1B|B|1C|G|H]]|9|@]|C|$]]|$1|I|3|-4|5|F|7|1D|8|@]|9|@]|C|$]]|$1|J|3|K|5|L|7|1E|8|@$A|1F|B|1G|G|H]]|9|@]|C|$M|-1|N|O]]|$1|P|3|-4|5|F|7|1H|8|@]|9|@]|C|$]]|$1|Q|3|R|5|S|7|1I|8|@]|9|@]|C|$T|U]]|$1|V|3|W|5|F|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]]|X|$Y|$5|Z|10|11|C|$12|13]]|14|$5|Z|10|11|C|$12|15]]]]

<h1><a href="https://www.ruby-lang.org/" rel="noreferrer">Ruby</a>, 20 bytes</h1>

<p><code>s[-1].ord</code> will give us the codepoint of the last character in the string, which we can then plug into this formula:
<span class="math-container">$$(160 \bmod c) \bmod 7 $$</span></p>



<pre class="lang-ruby prettyprint-override"><code>-&gt;s{160%s[-1].ord%7}
</code></pre>

<p><a href="https://tio.run/##KypNqvyfZvtf16642tDMQLU4WtcwVi@/KEXVvPZ/QWlJsUJatJKVhlIsF5xTg8zRROa4IHN0UTTpoujSRdGmC9T3HwA" rel="noreferrer" title="Ruby – Try It Online">Try it online!</a></p>


blocks|key|1040143|text|Python+3，25字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1040144|lambda+s:160%25ord(s[-1])%257|code-block|syntax|javascript|1040145|在网上试试！|unstyled|1040146|数学摘自@dingledooper|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##K6gsycjPM/6fpmCrEPM/JzE3KSVRodjK0MxANb8oRaM4WtcwVlPV/H9BUWZeiUaaRmZeQWmJhqam5n8rXRcA^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="nofollow noreferrer">Python 3</a>, 25 bytes</h1>



<pre class="lang-python prettyprint-override"><code>lambda s:160%ord(s[-1])%7
</code></pre>

<p><a href="https://tio.run/##K6gsycjPM/6fpmCrEPM/JzE3KSVRodjK0MxANb8oRaM4WtcwVlPV/H9BUWZeiUaaRmZeQWmJhqam5n8rXRcA" rel="nofollow noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>

<p>Math taken from @dingledooper</p>


blocks|key|1034434|text|Excel，25字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1034435|=FIND(RIGHT(A1),"(%7C)D")-1|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h2>Excel, 25 bytes</h2>

<pre><code>=FIND(RIGHT(A1),"(|)D")-1
</code></pre>


blocks|key|1034200|text|Bash+%2B+GNU实用程序，17字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034201|tr+'(%7C)D:-'+0-3\+|code-block|syntax|javascript|1034202|在网上试试！|unstyled|1034203|注意:反斜杠后面有一个空格字符。|1034204|输入stdin，输出stdout。|1034205|挑战没有指定输出的格式。根据输入的不同，该程序可以以%252d或%253d格式打印输出(即，在0、1、2或3之前有一两个空格)。|1034206|如果这是不能接受的，那么|1034207|tr+-s+'(%7C)D:-'+0-3\|style|CODE|1034208|(20个字节)总是以%252d格式打印数字。(在反斜杠后面也有一个空格。)|1034209|或|1034210|tr+'(%7C)D:-'+0-4%7Ctr+-d+4|1034211|(23个字节)只打印数字(没有空格)。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/bash/|1|https://tio.run/##S0oszvj/v6RIQV2jRtPFSlddwUDXOEbh/38rDS4r3RouKxcgpcllVQMA^0|0|4|0|0|0|0|6|1|0|0|0|0|0|0|J|0|0|0|0|N|0^^$0|@$1|2|3|4|5|6|7|1E|8|@]|9|@$A|1F|B|1G|1|1H]]|C|$]]|$1|D|3|E|5|F|7|1I|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|L|3|M|5|K|7|1N|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1O|8|@]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1P|8|@]|9|@]|C|$]]|$1|R|3|S|5|K|7|1Q|8|@]|9|@]|C|$]]|$1|T|3|U|5|K|7|1R|8|@$A|1S|B|1T|V|W]]|9|@]|C|$]]|$1|X|3|Y|5|K|7|1U|8|@]|9|@]|C|$]]|$1|Z|3|10|5|K|7|1V|8|@]|9|@]|C|$]]|$1|11|3|12|5|K|7|1W|8|@$A|1X|B|1Y|V|W]]|9|@]|C|$]]|$1|13|3|14|5|K|7|1Z|8|@]|9|@]|C|$]]]|15|$16|$5|17|18|19|C|$1A|1B]]|1C|$5|17|18|19|C|$1A|1D]]]]

<h1><a href="https://www.gnu.org/software/bash/" rel="nofollow noreferrer">Bash</a> + GNU utilities, 17 bytes</h1>



<pre class="lang-bash prettyprint-override"><code>tr '(|)D:-' 0-3\ 
</code></pre>

<p><a href="https://tio.run/##S0oszvj/v6RIQV2jRtPFSlddwUDXOEbh/38rDS4r3RouKxcgpcllVQMA" rel="nofollow noreferrer" title="Bash – Try It Online">Try it online!</a></p>

<p><em>Note: There's a space character after the backslash.</em></p>

<p>Input on stdin, output on stdout.</p>

<p>The challenge doesn't specify the format of the output.  Depending on the input, this program may print the output in either %2d or %3d format (that is, with one or two spaces before the 0, 1, 2, or 3).  </p>

<p>If that's not acceptable, then</p>

<p><code>tr -s '(|)D:-' 0-3\</code></p>

<p><strong>(20 bytes)</strong> always prints the digit in %2d format.  (There's a space after the backslash here too.)</p>

<p>Or</p>

<p><code>tr '(|)D:-' 0-4|tr -d 4</code></p>

<p><strong>(23 bytes)</strong> prints just the digit (with no spaces).</p>


blocks|key|1034267|text|拉库，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034268|{TR:d/(%7C)D:-/0123/}|code-block|syntax|javascript|1034269|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/nxadm/rakudo-pkg|1|https://tio.run/##K0gtyjH7n1upoJamYPu/OiTIKkVfo0bTxUpX38DQyFi/9n9xYqWCHlA2Lb9IISczL7X4v5UGl5VuDZeVC5DS5LKqAQA^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/nxadm/rakudo-pkg" rel="nofollow noreferrer">Raku</a>, 19 bytes</h1>



<pre class="lang-perl6 prettyprint-override"><code>{TR:d/(|)D:-/0123/}
</code></pre>

<p><a href="https://tio.run/##K0gtyjH7n1upoJamYPu/OiTIKkVfo0bTxUpX38DQyFi/9n9xYqWCHlA2Lb9IISczL7X4v5UGl5VuDZeVC5DS5LKqAQA" rel="nofollow noreferrer" title="Perl 6 – Try It Online">Try it online!</a></p>


blocks|key|1040956|text|Mornington新月，1820年字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1040957|在网上试试！|unstyled|offset|length|1040958|@dingledooper的一个端口--非常棒的Ruby答案--因为它有一个方便的7，所以它恰好在Mornington新月中无缝地工作。道具给他们！|style|CODE|1040959|Take+Northern+Line+to+Leicester+Square
Take+Northern+Line+to+Leicester+Square
Take+Piccadilly+Line+to+Turnpike+Lane
Take+Piccadilly+Line+to+Turnpike+Lane
Take+Piccadilly+Line+to+Leicester+Square
Take+Northern+Line+to+Leicester+Square
Take+Northern+Line+to+Charing+Cross
Take+Northern+Line+to+Charing+Cross
Take+Bakerloo+Line+to+Baker+Street
Take+Bakerloo+Line+to+Paddington
Take+Bakerloo+Line+to+Charing+Cross
Take+Bakerloo+Line+to+Charing+Cross
Take+Northern+Line+to+Moorgate
Take+Circle+Line+to+Moorgate
Take+Metropolitan+Line+to+Chalfont+&+Latimer
Take+Metropolitan+Line+to+King's+Cross+St.+Pancras
Take+Victoria+Line+to+Seven+Sisters
Take+Victoria+Line+to+Victoria
Take+Circle+Line+to+Victoria
Take+Circle+Line+to+Bank
Take+Circle+Line+to+Hammersmith
Take+Circle+Line+to+Cannon+Street
Take+Circle+Line+to+Hammersmith
Take+Circle+Line+to+Cannon+Street
Take+Circle+Line+to+Bank
Take+Circle+Line+to+Hammersmith
Take+District+Line+to+Upminster
Take+District+Line+to+Hammersmith
Take+District+Line+to+Upminster
Take+District+Line+to+Victoria
Take+Circle+Line+to+Victoria
Take+Circle+Line+to+Aldgate
Take+Circle+Line+to+Aldgate
Take+Metropolitan+Line+to+Chalfont+&+Latimer
Take+Metropolitan+Line+to+Preston+Road
Take+Metropolitan+Line+to+Baker+Street
Take+Metropolitan+Line+to+Preston+Road
Take+Metropolitan+Line+to+Pinner
Take+Metropolitan+Line+to+Preston+Road
Take+Metropolitan+Line+to+King's+Cross+St.+Pancras
Take+Victoria+Line+to+Seven+Sisters
Take+Victoria+Line+to+King's+Cross+St.+Pancras
Take+Circle+Line+to+King's+Cross+St.+Pancras
Take+Metropolitan+Line+to+Pinner
Take+Metropolitan+Line+to+Preston+Road
Take+Metropolitan+Line+to+Pinner
Take+Metropolitan+Line+to+Preston+Road
Take+Metropolitan+Line+to+King's+Cross+St.+Pancras
Take+Circle+Line+to+King's+Cross+St.+Pancras
Take+Northern+Line+to+Mornington+Crescent|code-block|syntax|javascript|1040960|我觉得我需要指出的唯一主要的事情是我是如何在程序中获得160的。为此，我使用了Paddington的第一个字母，它在运行Cross时给出了80的ASCII值，然后在Chalfon&Latimer中乘以2得到160。随后，该程序通过Preston计算160+%25+(ASCII+of+last+character)+%25+7，该公式由@dingledooper找到。|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##vZXBTsJAEIbvPsWeNB7wAbxJPZgIprHofbIdYcJ2BqeDiU@Pi0ATpG2KBS497P91@v8zu9tClImnJjzwiqVHttVqAnN0L6I2Q2U3IkZn4kZIHktDddnnEhSvjsFS8h5yCuG7AidL5QVFbQTcl@rl7QBLZqCxKS5RKcvuzDA@NIhUzO@Cy0wRrQFJIc83/W8Aunyni9@xiE7BtpETUh@wQRyjqSwkkMFe3vAhbO46TsKoQG2Bn6Obm3LjJ@a/izHZK2y9vZM3UYIKz/AL2WW0nkwTs1uo9d8qDoHntcITFDFGWZDNavUEmIX35nfyCt3NPcb2aMxZEW@Lgnjdsga9f4X/9/wh5I2bbU/rv9fSeG3F4@NeBfIW7PAs9qmWEvMpXJ3hoLSX/DOLdvis0S/TwqPy1lyau79jfGX3d7wf3P4A^0|0|0|6|0|0|15|1|0|0|R|3|13|A|1X|2|2S|1|2V|3|3G|Z^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@$E|10|F|11|1|12]]|A|$]]|$1|G|3|H|5|D|7|13|8|@$E|14|F|15|I|J]]|9|@]|A|$]]|$1|K|3|L|5|M|7|16|8|@]|9|@]|A|$N|O]]|$1|P|3|Q|5|D|7|17|8|@$E|18|F|19|I|J]|$E|1A|F|1B|I|J]|$E|1C|F|1D|I|J]|$E|1E|F|1F|I|J]|$E|1G|F|1H|I|J]|$E|1I|F|1J|I|J]]|9|@]|A|$]]]|R|$S|$5|T|U|V|A|$W|X]]]]

<h1>Mornington Crescent, 1820 bytes</h1>

<p><a href="https://tio.run/##vZXBTsJAEIbvPsWeNB7wAbxJPZgIprHofbIdYcJ2BqeDiU@Pi0ATpG2KBS497P91@v8zu9tClImnJjzwiqVHttVqAnN0L6I2Q2U3IkZn4kZIHktDddnnEhSvjsFS8h5yCuG7AidL5QVFbQTcl@rl7QBLZqCxKS5RKcvuzDA@NIhUzO@Cy0wRrQFJIc83/W8Aunyni9@xiE7BtpETUh@wQRyjqSwkkMFe3vAhbO46TsKoQG2Bn6Obm3LjJ@a/izHZK2y9vZM3UYIKz/AL2WW0nkwTs1uo9d8qDoHntcITFDFGWZDNavUEmIX35nfyCt3NPcb2aMxZEW@Lgnjdsga9f4X/9/wh5I2bbU/rv9fSeG3F4@NeBfIW7PAs9qmWEvMpXJ3hoLSX/DOLdvis0S/TwqPy1lyau79jfGX3d7wf3P4A" rel="nofollow noreferrer">Try it online!</a></p>

<p>A port of @dingledooper's fantastic Ruby answer, which just so happens to work seamlessly in Mornington Crescent because of a convenient <code>7</code> in it. Props to them!</p>

<pre><code>Take Northern Line to Leicester Square
Take Northern Line to Leicester Square
Take Piccadilly Line to Turnpike Lane
Take Piccadilly Line to Turnpike Lane
Take Piccadilly Line to Leicester Square
Take Northern Line to Leicester Square
Take Northern Line to Charing Cross
Take Northern Line to Charing Cross
Take Bakerloo Line to Baker Street
Take Bakerloo Line to Paddington
Take Bakerloo Line to Charing Cross
Take Bakerloo Line to Charing Cross
Take Northern Line to Moorgate
Take Circle Line to Moorgate
Take Metropolitan Line to Chalfont &amp; Latimer
Take Metropolitan Line to King's Cross St. Pancras
Take Victoria Line to Seven Sisters
Take Victoria Line to Victoria
Take Circle Line to Victoria
Take Circle Line to Bank
Take Circle Line to Hammersmith
Take Circle Line to Cannon Street
Take Circle Line to Hammersmith
Take Circle Line to Cannon Street
Take Circle Line to Bank
Take Circle Line to Hammersmith
Take District Line to Upminster
Take District Line to Hammersmith
Take District Line to Upminster
Take District Line to Victoria
Take Circle Line to Victoria
Take Circle Line to Aldgate
Take Circle Line to Aldgate
Take Metropolitan Line to Chalfont &amp; Latimer
Take Metropolitan Line to Preston Road
Take Metropolitan Line to Baker Street
Take Metropolitan Line to Preston Road
Take Metropolitan Line to Pinner
Take Metropolitan Line to Preston Road
Take Metropolitan Line to King's Cross St. Pancras
Take Victoria Line to Seven Sisters
Take Victoria Line to King's Cross St. Pancras
Take Circle Line to King's Cross St. Pancras
Take Metropolitan Line to Pinner
Take Metropolitan Line to Preston Road
Take Metropolitan Line to Pinner
Take Metropolitan Line to Preston Road
Take Metropolitan Line to King's Cross St. Pancras
Take Circle Line to King's Cross St. Pancras
Take Northern Line to Mornington Crescent
</code></pre>

<p>The only major thing I feel I need to point out is how I got <code>160</code> in the program. To do this, I took the first letter of <code>Paddington</code>, which gives an ASCII value of <code>80</code> when run through Charing Cross, then multiplied it by <code>2</code> in Chalfont &amp; Latimer to get <code>160</code>. Subsequently, the program computes <code>160 % (ASCII of last character) % 7</code> via Preston Road, the formula found by @dingledooper.</p>


blocks|key|1040204|text|马蒂尔，9字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1040205|'%7C)D'jmfs|code-block|syntax|javascript|1040206|在网上试试！|unstyled|1040207|解释|1040208|'%7C)D'+%25+Push+this+string
j+++++%25+Read+input+as+unevaluated+string
m+++++%25+ismember:+true+for+chars+of+the+first+string+that+are+present+in+the+second
f+++++%25+find:+(1-based)+indices+of+true+entries.+The+result+will+have+length+0+or+1
s+++++%25+sum.+This+is+needed+to+transform+an+empty+array+into+0
++++++%25+Implicitly+display|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lmendo/MATL|1|https://tio.run/##y00syfn/X71G00U9Kzet@P9/K10XAA^0|0|3|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/lmendo/MATL" rel="nofollow noreferrer">MATL</a>, 9 bytes</h1>

<pre><code>'|)D'jmfs
</code></pre>

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

<h3>Explanation</h3>

<pre><code>'|)D' % Push this string
j     % Read input as unevaluated string
m     % ismember: true for chars of the first string that are present in the second
f     % find: (1-based) indices of true entries. The result will have length 0 or 1
s     % sum. This is needed to transform an empty array into 0
      % Implicitly display
</code></pre>


blocks|key|1040457|text|木桶，-hr，18字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1040458|?%5E⑵¦P0%7C\1%7CR2%7C\¦3™|code-block|syntax|javascript|1040459|在网上试试！|unstyled|1040460|相同的开关语句格式，但具有不同的字符检查标准。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/JonoCode9374/Keg|1|https://tio.run/##y05N///fPu7RxK2HlgUY1MR8mN/SbFgTZFQTc2iZ8aOWRf//W@mCgOZ/3YwiAA^0|3|3|0|2|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|Y|8|@$9|Z|A|10|B|C]]|D|@$9|11|A|12|1|13]]|E|$]]|$1|F|3|G|5|H|7|14|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|15|8|@]|D|@$9|16|A|17|1|18]]|E|$]]|$1|N|3|O|5|M|7|19|8|@]|D|@]|E|$]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|R|S|T|E|$U|X]]]]

<h1><a href="https://github.com/JonoCode9374/Keg" rel="nofollow noreferrer">Keg</a>, <code>-hr</code>, 18 bytes</h1>

<pre><code>?^⑵¦P0|\1|R2|\¦3™
</code></pre>

<p><a href="https://tio.run/##y05N///fPu7RxK2HlgUY1MR8mN/SbFgTZFQTc2iZ8aOWRf//W@mCgOZ/3YwiAA" rel="nofollow noreferrer" title="Keg – Try It Online">Try it online!</a></p>

<p>The same switch statement format, but with a different character checking criteria.</p>


blocks|key|1040496|text|05AB1E，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1040497|θÇx19%254%25|code-block|syntax|javascript|1040498|在网上试试！|unstyled|1040499|解释|1040500|我用了乌里尔的配方。|1040501|θ++++++++#+Get+mouth+(last+char)
+Ç+++++++#+ASCII+value
++x++++++#+Multiply+by+2
+++19%25+++#+Modulo+19
++++++4%25+#+Modulo+4|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##yy9OTMpM/f//3I7D7RWGlqomqv//W7kAAA^0|0|6|0|0|0|0|6|1|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|6|7|19|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1A|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1B|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 8 bytes</h1>

<pre><code>θÇx19%4%
</code></pre>

<p><a href="https://tio.run/##yy9OTMpM/f//3I7D7RWGlqomqv//W7kAAA" rel="nofollow noreferrer" title="05AB1E – Try It Online">Try it online!</a></p>

<h3>Explanation</h3>

<p>I used Uriel's formula.</p>

<pre><code>θ        # Get mouth (last char)
 Ç       # ASCII value
  x      # Multiply by 2
   19%   # Modulo 19
      4% # Modulo 4
</code></pre>


blocks|key|1033921|text|Perl+5+-p，24字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1033922|s/.*(.)/ord($1)*2%2519%254/e|code-block|syntax|javascript|1033923|在网上试试！|unstyled|1033924|从@Uriel的Python答案中窃取数学|entityMap|0|LINK|mutability|MUTABLE|url|https://www.perl.org/|1|https://tio.run/##K0gtyjH9/79YX09LQ09TP78oRUPFUFPLSNXQUtVEP/X/fysNLivdGi4rFyClyWVV8y@/oCQzP6/4v25BDgA^0|7|2|0|6|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|Y|8|@$9|Z|A|10|B|C]]|D|@$9|11|A|12|1|13]]|E|$]]|$1|F|3|G|5|H|7|14|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|15|8|@]|D|@$9|16|A|17|1|18]]|E|$]]|$1|N|3|O|5|M|7|19|8|@]|D|@]|E|$]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|R|S|T|E|$U|X]]]]

<h1><a href="https://www.perl.org/" rel="nofollow noreferrer">Perl 5</a> <code>-p</code>, 24 bytes</h1>



<pre class="lang-perl prettyprint-override"><code>s/.*(.)/ord($1)*2%19%4/e
</code></pre>

<p><a href="https://tio.run/##K0gtyjH9/79YX09LQ09TP78oRUPFUFPLSNXQUtVEP/X/fysNLivdGi4rFyClyWVV8y@/oCQzP6/4v25BDgA" rel="nofollow noreferrer" title="Perl 5 – Try It Online">Try it online!</a></p>

<p>Steals the math from @Uriel's Python answer</p>


blocks|key|1034045|text|木炭，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034046|Ｉ⌕(%7C)D§Ｓ±¹|code-block|syntax|javascript|1034047|在网上试试！链接是详细的代码版本。解释：|unstyled|1034048|+++++++Ｓ++++Input+string
++++++§+++++Cyclically+indexed+by
+++++++++¹++Literal+1
++++++++±+++Negated
+⌕++++++++++Find+index+in
++(%7C)D++++++Literal+string+of+mouths
Ｉ+++++++++++Cast+to+string
++++++++++++Implicitly+print|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/somebody1234/Charcoal|1|https://tio.run/##S85ILErOT8z5/z@gKDOvRMM5sbhEwy0zL0VDSaNG00VJR8GxxDMvJbVCwzOvoLQkuASoKl1DU0fBLzU9sSRVw1ATBKz//7fS1fyvW5YDAA^0|0|2|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

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

<pre><code>Ｉ⌕(|)D§Ｓ±¹
</code></pre>

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

<pre><code>       Ｓ    Input string
      §     Cyclically indexed by
         ¹  Literal 1
        ±   Negated
 ⌕          Find index in
  (|)D      Literal string of mouths
Ｉ           Cast to string
            Implicitly print
</code></pre>


blocks|key|1040290|text|井上，31字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1040291|Io的字符串是由整数组成的，因此字符转换是不相关的.虽然Io不允许我们使用last()索引序列的最后一项.|unstyled|style|CODE|1040292|method(x,160%25x+reverse+at(0)%257)|code-block|syntax|javascript|1040293|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://iolanguage.org/|1|https://tio.run/##y8z/n5FYUFCpYGWrEPM/N7UkIz9Fo0LH0MxAtUKhKLUstag4VSGxRMNAU9VcE6JUQ8lKV1NJU6GgKDOv5D8A^0|0|2|0|0|11|6|0|0|0|6|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|@$A|13|B|14|G|H]]|9|@]|C|$]]|$1|I|3|J|5|K|7|15|8|@]|9|@]|C|$L|M]]|$1|N|3|O|5|F|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="http://iolanguage.org/" rel="nofollow noreferrer">Io</a>, 31 bytes</h1>

<p>Io's strings are made of integers, so character-converting is unneccecary. Although Io doesn't allow us to index the last item of a sequence using <code>last()</code>...</p>

<pre><code>method(x,160%x reverse at(0)%7)
</code></pre>

<p><a href="https://tio.run/##y8z/n5FYUFCpYGWrEPM/N7UkIz9Fo0LH0MxAtUKhKLUstag4VSGxRMNAU9VcE6JUQ8lKV1NJU6GgKDOv5D8A" rel="nofollow noreferrer" title="Io – Try It Online">Try it online!</a></p>


blocks|key|1034297|text|纳兹，120字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034298|8a5m2x1v1a2x2v4a2x3v9a9a5a2x4v1x1f2r3x3v1e2f0x1x2f3x1v3e3x2v5e3x4v6e4f0x1x3f0m1o0x1x4f0m1a1o0x1x5f0m2a1o0x1x6f0m3a1o0x1f|code-block|syntax|javascript|1034299|解释(删除0x命令)|unstyled|style|CODE|1034300|8a5m2x1v+++++++++++++++++#+Set+variable+1+equal+to+40+("(")
1a2x2v+++++++++++++++++++#+Set+variable+2+equal+to+41+(")")
4a2x3v+++++++++++++++++++#+Set+variable+3+equal+to+45+("-")
9a9a5a2x4v+++++++++++++++#+Set+variable+4+equal+to+68+("D")
1x1f+++++++++++++++++++++#+Function+1
++++2r+++++++++++++++++++#+Read+the+second+byte+in+the+input+string,+removing+it
++++++3x3v1e+++++++++++++#+Jump+back+to+the+start+of+the+function+if+it+equals+variable+3
++++++++++++2f+++++++++++#+Otherwise,+jump+to+function+2
1x2f+++++++++++++++++++++#+Function+2
++++3x1v3e+++++++++++++++#+Jump+to+function+3+if+the+register+equals+variable+1
++++++++++3x2v5e+++++++++#+Jump+to+function+5+if+the+register+equals+variable+2
++++++++++++++++3x4v6e+++#+Jump+to+function+6+if+the+register+equals+variable+4
++++++++++++++++++++++4f+#+Otherwise,+jump+to+function+4
1x3f+++++++++++++++++++++#+Function+3
++++0m1o+++++++++++++++++#+Output+0
1x4f+++++++++++++++++++++#+Function+4
++++0m1a1o+++++++++++++++#+Output+1
1x5f+++++++++++++++++++++#+Function+5
++++0m2a1o+++++++++++++++#+Output+2
1x6f+++++++++++++++++++++#+Function+6
++++0m3a1o+++++++++++++++#+Output+3
1f+++++++++++++++++++++++#+Call+function+1|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/sporeball/naz^0|0|2|0|0|0|5|2|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|@$A|12|B|13|L|M]]|9|@]|C|$]]|$1|N|3|O|5|F|7|14|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]]]

<h1><a href="https://github.com/sporeball/naz" rel="nofollow noreferrer">naz</a>, 120 bytes</h1>

<pre><code>8a5m2x1v1a2x2v4a2x3v9a9a5a2x4v1x1f2r3x3v1e2f0x1x2f3x1v3e3x2v5e3x4v6e4f0x1x3f0m1o0x1x4f0m1a1o0x1x5f0m2a1o0x1x6f0m3a1o0x1f
</code></pre>

<p><strong>Explanation</strong> (with <code>0x</code> commands removed)</p>

<pre><code>8a5m2x1v                 # Set variable 1 equal to 40 ("(")
1a2x2v                   # Set variable 2 equal to 41 (")")
4a2x3v                   # Set variable 3 equal to 45 ("-")
9a9a5a2x4v               # Set variable 4 equal to 68 ("D")
1x1f                     # Function 1
    2r                   # Read the second byte in the input string, removing it
      3x3v1e             # Jump back to the start of the function if it equals variable 3
            2f           # Otherwise, jump to function 2
1x2f                     # Function 2
    3x1v3e               # Jump to function 3 if the register equals variable 1
          3x2v5e         # Jump to function 5 if the register equals variable 2
                3x4v6e   # Jump to function 6 if the register equals variable 4
                      4f # Otherwise, jump to function 4
1x3f                     # Function 3
    0m1o                 # Output 0
1x4f                     # Function 4
    0m1a1o               # Output 1
1x5f                     # Function 5
    0m2a1o               # Output 2
1x6f                     # Function 6
    0m3a1o               # Output 3
1f                       # Call function 1
</code></pre>


blocks|key|1034414|text|红色，32字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034415|func[s][select"(0%7C1)2D3"last+s]|code-block|syntax|javascript|1034416|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://www.red-lang.org/|1|https://tio.run/##K0pN@R@UmhIdy5Vm9T@tNC85ujg2ujg1JzW5REnDoMZQ08jFWCknsbhEoTiW639aflFqYnKGQmpuflZmNJcCEChZaShBGbo1MJYLXEgTxgLKxUJ0FBRl5pUoRBckpigAzcuFGKZgrKCka6ekkAbhxnLF/gcA^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="http://www.red-lang.org" rel="nofollow noreferrer">Red</a>, 32 bytes</h1>

<pre><code>func[s][select"(0|1)2D3"last s]

</code></pre>

<p><a href="https://tio.run/##K0pN@R@UmhIdy5Vm9T@tNC85ujg2ujg1JzW5REnDoMZQ08jFWCknsbhEoTiW639aflFqYnKGQmpuflZmNJcCEChZaShBGbo1MJYLXEgTxgLKxUJ0FBRl5pUoRBckpigAzcuFGKZgrKCka6ekkAbhxnLF/gcA" rel="nofollow noreferrer" title="Red – Try It Online">Try it online!</a></p>


blocks|key|1034786|text|国际语音深奥语言，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034787|iʁ2f{J}ⱱ4ⱱo|code-block|syntax|javascript|1034788|基于乌里尔公式。|unstyled|1034789|iʁ2f{J}ⱱ4ⱱo
iʁ++++++++++(split+the+face+into+it's+ord+values)
++2f++++++++(mouth+*+2)
++++{J}ⱱ++++(mod+19)+(base+26)
++++++++4ⱱ++(mod+4)
++++++++++o+(print)|entityMap|0|LINK|mutability|MUTABLE|url|https://esolangs.org/wiki/International_Phonetic_Esoteric_Language|1|https://codegolf.stackexchange.com/a/202898/77309^0|0|8|0|0|0|2|5|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://esolangs.org/wiki/International_Phonetic_Esoteric_Language" rel="nofollow noreferrer">International Phonetic Esoteric Language</a>, 11 bytes</h1>
<pre><code>iʁ2f{J}ⱱ4ⱱo
</code></pre>
<p>Based on <a href="https://codegolf.stackexchange.com/a/202898/77309">Uriel's formula</a>.</p>
<pre><code>iʁ2f{J}ⱱ4ⱱo
iʁ          (split the face into it's ord values)
  2f        (mouth * 2)
    {J}ⱱ    (mod 19) (base 26)
        4ⱱ  (mod 4)
          o (print)
</code></pre>


blocks|key|1035023|text|sed，20字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1035024|y/(%7C)D/0123/;s/:-*//|code-block|syntax|javascript|1035025|很自然的解释。使用y///+transform命令将“口”字符替换为数字，然后去掉眼睛和鼻子(如果存在的话)。|unstyled|style|CODE|1035026|在网上试试！|1035027|这是一个字节，但它可能会因为代码本身有一个表情符号而得到额外的分数？:-\。|1035028|y/(%7C)D/0123/;s/:-\?//|1035029|较短的解决方案(16字节)|1035030|y/(%7C)D:-/0123++/|1035031|同样有效，但在每一行输出中都添加了额外的空格。它还有两个表情符号D:和:-/。:)|1035032|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/sed/|1|https://tio.run/##Dco7CoAwEAXAfk@xgkUiLM9Pt0KqFN7BT6VolSYIEXL3mGqaidcpd3jLQxEtWByDUvlgsvXoh3HCHKHSAWWhVNMWAIKsh9vRRDCYUdSQSib1FUuafw|2|https://tio.run/##K05N0U3PK/2fwVWsr6KvoGunoM9V8b9SX6NG08VKV9/A0MhYQUH/vwdXBVBBTJ6@Ppe@bnScXay@YrG@gj5IykqDy0q3hsvKBUhpclnVAAA^0|0|3|0|0|0|9|4|0|0|6|1|0|Y|3|0|0|0|0|W|2|Z|3|0|0|6|2^^$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|@$A|1H|B|1I|L|M]]|9|@]|C|$]]|$1|N|3|O|5|K|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|P|3|Q|5|K|7|1N|8|@$A|1O|B|1P|L|M]]|9|@]|C|$]]|$1|R|3|S|5|F|7|1Q|8|@]|9|@]|C|$G|H]]|$1|T|3|U|5|K|7|1R|8|@]|9|@]|C|$]]|$1|V|3|W|5|F|7|1S|8|@]|9|@]|C|$G|H]]|$1|X|3|Y|5|K|7|1T|8|@$A|1U|B|1V|L|M]|$A|1W|B|1X|L|M]]|9|@]|C|$]]|$1|Z|3|O|5|K|7|1Y|8|@]|9|@$A|1Z|B|20|1|21]]|C|$]]]|10|$11|$5|12|13|14|C|$15|16]]|17|$5|12|13|14|C|$15|18]]|19|$5|12|13|14|C|$15|1A]]]]

<h1><a href="https://www.gnu.org/software/sed/" rel="nofollow noreferrer">sed</a>, 20 bytes</h1>
<pre><code>y/(|)D/0123/;s/:-*//
</code></pre>
<p>Pretty self explanatory. Replaces the the &quot;mouth&quot; characters with numbers using the <code>y///</code> transform command and then strips off the eyes and the nose if they exist.</p>
<p><a href="https://tio.run/##Dco7CoAwEAXAfk@xgkUiLM9Pt0KqFN7BT6VolSYIEXL3mGqaidcpd3jLQxEtWByDUvlgsvXoh3HCHKHSAWWhVNMWAIKsh9vRRDCYUdSQSib1FUuafw" rel="nofollow noreferrer" title="sed – Try It Online">Try it online!</a></p>
<p>This is one byte longer, but perhaps it gets bonus points for having an emoticon in the code itself? <code>:-\</code></p>
<pre><code>y/(|)D/0123/;s/:-\?//
</code></pre>
<p>The shorter solution (16 bytes)</p>
<pre><code>y/(|)D:-/0123  /
</code></pre>
<p>also works, but adds extra whitespace to each line of output. It also has two emoticons <code>D:</code> and <code>:-/</code>. :)</p>
<p><a href="https://tio.run/##K05N0U3PK/2fwVWsr6KvoGunoM9V8b9SX6NG08VKV9/A0MhYQUH/vwdXBVBBTJ6@Ppe@bnScXay@YrG@gj5IykqDy0q3hsvKBUhpclnVAAA" rel="nofollow noreferrer" title="sed – Try It Online">Try it online!</a></p>


blocks|key|1040254|text|杰夫特，9+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1040255|"(%7C)D"bUÌ|code-block|syntax|javascript|1040256|试试看|unstyled|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=Iih8KUQiYlXM&input=IjooIg^0|0|3|0|6|3|1|0|0|0|3|2^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]|$A|10|B|11|1|12]]|C|$]]|$1|D|3|E|5|F|7|13|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|14|8|@]|9|@$A|15|B|16|1|17]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]|U|$5|N|O|P|C|$Q|V]]]]

<h1><a href="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 9 <a href="https://en.wikipedia.org/wiki/ISO/IEC_8859-1" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>&quot;(|)D&quot;bUÌ
</code></pre>
<p><a href="https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&amp;code=Iih8KUQiYlXM&amp;input=IjooIg" rel="nofollow noreferrer">Try it</a></p>


blocks|key|1034139|text|Erlang+(讲稿)，32字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034140|长篇大论使这位旁观者感到不快。|unstyled|1034141|h(I)->160rem+lists:last(I)rem+7.|code-block|syntax|javascript|1034142|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://erlang.org/doc/man/escript.html|1|https://tio.run/##Sy3KScxL100tTi7KLCj5z/U/Q8NTU9fO0MygKDVXISezuKTYKiexuAQoChIw1/ufm5iZpxEdq6mga8elAASZ@VblRZklqRoZGkpWuppKmpp6/wE^0|0|B|0|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|11|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="http://erlang.org/doc/man/escript.html" rel="nofollow noreferrer">Erlang (escript)</a>, 32 bytes</h1>

<p>The verbosity offseted the bytecount.</p>



<pre class="lang-erlang prettyprint-override"><code>h(I)-&gt;160rem lists:last(I)rem 7.
</code></pre>

<p><a href="https://tio.run/##Sy3KScxL100tTi7KLCj5z/U/Q8NTU9fO0MygKDVXISezuKTYKiexuAQoChIw1/ufm5iZpxEdq6mga8elAASZ@VblRZklqRoZGkpWuppKmpp6/wE" rel="nofollow noreferrer" title="Erlang (escript) – Try It Online">Try it online!</a></p>


blocks|key|1040539|text|W，7+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1040540|☻M:ù·±♥|code-block|syntax|javascript|1040541|未压缩的：|unstyled|1040542|(%7C)D"azx|1040543|解释|1040544|+++++++++%25+Implicit+quote
(%7C)D"++++%25+The+string+"(%7C)D"
+++++az++%25+The+last+item+of+the+input
+++++++x+%25+Where+is+%5E+in+the+above+string?|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/A-ee/w|1|https://github.com/A-ee/w/wiki/Code-Page^0|0|1|0|4|3|1|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]|$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|@]|C|$]]|$1|L|3|M|5|F|7|19|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|6|7|1A|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1B|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://github.com/A-ee/w" rel="nofollow noreferrer">W</a>, 7 <a href="https://github.com/A-ee/w/wiki/Code-Page" rel="nofollow noreferrer">bytes</a></h1>

<pre><code>☻M:ù·±♥
</code></pre>

<p>Uncompressed:</p>

<pre><code>(|)D"azx
</code></pre>

<h2>Explanation</h2>

<pre><code>         % Implicit quote
(|)D"    % The string "(|)D"
     az  % The last item of the input
       x % Where is ^ in the above string?
</code></pre>


blocks|key|1034509|text|GolfScript，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034510|)3?11%252/(p;|code-block|syntax|javascript|1034511|我确信我的方法是最小的，但这不是最好的方法--只是最早的低价值方法之一。|unstyled|1034512|)3?11%252/(p;
)+++++++++++#Pop+the+last+element+of+the+string+(as+ascii+value)
+3?+++++++++#Cube+the+number
+++11%25++++++#Modulo+11
++++++2/++++#Divide+by+2+(round+down)
++++++++(+++#Decrement+by+one+(gotta+be+0+1+2+3,+not+1+2+3+4)
+++++++++p;+#Print+the+value+we+want,+and+shunt+the+rest+of+the+stack|1034513|我用以下TIO搜索答案，11很早就出现了。我也试过正方形和更高的力量，但它们没有那么干净和短。|1034514|在网上试试！|1034515|每一个案子！|entityMap|0|LINK|mutability|MUTABLE|url|http://www.golfscript.com/golfscript/|1|https://tio.run/##XVFRS8MwEH7vrzhSB07HGIgIDhHZFPYwFHxUH7Lmuh5kSUhS5pz97fXaKu3MS467@@77vrut1XnIPLlY19e3NIf@pStDkaSmLwSC3HqwZQRtrUvexLkQ30KMhViKD0ifvUKPCh5eF6tVcoSTlz47NB0OYHpSWZZOUyYj8mgP0nt5mLRMsaDwB6HxQBeLyjzK0EjaHMAa5I4TwvSJ8SizAlDjDk0EMv34pGkZv/fzXqxjNoTI/y9gAoojFtXkC2m2ZLYgRAu9uu@JFuUG2ySN@uTaKiDOVqOhprV0nadoey2wR3Do2e@Od8dk7EpmkawJUDprmnVNz@4GB8m7IR2ag2B9ZKjUvBLVeDvSpauO84ry1punxn6EPcWCFxaidJr7rWmtoVETsBz5PTF1KErulkaBR4cyJtW/Oy605bb2Kjez2cWw9PiJWckb4zxE2mGo6x8|2|https://tio.run/##S8/PSStOLsosKPmvZKXrovRf09je0FDVSF@jwPr/fwA|3|https://tio.run/##S8/PSStOLsosKPn/P1rJSkNJQcmqBkRogggXEKELFtQFi@qChXVdlGK5qrm4NI3tDQ1VjfQ1Cqy5uGpVuf5z/QcA^0|0|A|0|0|0|0|0|2|5|1|0|0|6|2|0|0|6|3^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]|$1|D|3|E|5|F|7|1A|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1B|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|1C|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|P|3|Q|5|K|7|1H|8|@]|9|@$A|1I|B|1J|1|1K]]|C|$]]|$1|R|3|S|5|K|7|1L|8|@]|9|@$A|1M|B|1N|1|1O]]|C|$]]]|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]]|14|$5|V|W|X|C|$Y|15]]]]

<h1><a href="http://www.golfscript.com/golfscript/" rel="nofollow noreferrer">GolfScript</a>, 11 bytes</h1>

<pre><code>)3?11%2/(p;
</code></pre>

<p>I'm convinced my method is the smallest possible, but this isn't the best possible one - just one of the earliest low-value ones.</p>

<pre><code>)3?11%2/(p;
)           #Pop the last element of the string (as ascii value)
 3?         #Cube the number
   11%      #Modulo 11
      2/    #Divide by 2 (round down)
        (   #Decrement by one (gotta be 0 1 2 3, not 1 2 3 4)
         p; #Print the value we want, and shunt the rest of the stack
</code></pre>

<p>I used <a href="https://tio.run/##XVFRS8MwEH7vrzhSB07HGIgIDhHZFPYwFHxUH7Lmuh5kSUhS5pz97fXaKu3MS467@@77vrut1XnIPLlY19e3NIf@pStDkaSmLwSC3HqwZQRtrUvexLkQ30KMhViKD0ifvUKPCh5eF6tVcoSTlz47NB0OYHpSWZZOUyYj8mgP0nt5mLRMsaDwB6HxQBeLyjzK0EjaHMAa5I4TwvSJ8SizAlDjDk0EMv34pGkZv/fzXqxjNoTI/y9gAoojFtXkC2m2ZLYgRAu9uu@JFuUG2ySN@uTaKiDOVqOhprV0nadoey2wR3Do2e@Od8dk7EpmkawJUDprmnVNz@4GB8m7IR2ag2B9ZKjUvBLVeDvSpauO84ry1punxn6EPcWCFxaidJr7rWmtoVETsBz5PTF1KErulkaBR4cyJtW/Oy605bb2Kjez2cWw9PiJWckb4zxE2mGo6x8" rel="nofollow noreferrer" title="GolfScript – Try It Online">the following TIO</a> to search for answers, and 11 popped up quite early. I also tried squares and higher powers, but they weren't as clean and short.</p>

<p><a href="https://tio.run/##S8/PSStOLsosKPmvZKXrovRf09je0FDVSF@jwPr/fwA" rel="nofollow noreferrer" title="GolfScript – Try It Online">Try it online!</a></p>

<p><a href="https://tio.run/##S8/PSStOLsosKPn/P1rJSkNJQcmqBkRogggXEKELFtQFi@qChXVdlGK5qrm4NI3tDQ1VjfQ1Cqy5uGpVuf5z/QcA" rel="nofollow noreferrer" title="GolfScript – Try It Online">Every case!</a></p>


blocks|key|1034675|text|PowerShell，16字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034676|2*$args[-1]%2519%254|code-block|syntax|javascript|1034677|在网上试试！|unstyled|1034678|模块公式的PowerShell端口正在运行。通过喷溅获取输入|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/TryItOnline/TioSetup/wiki/Powershell|1|https://tio.run/##K8gvTy0qzkjNyfmvkmZb/d9ISyWxKL04WtcwVtXQUtXkfy2XjTKXAhBYaVgpGEBYNVYKhhCWppWCEYTlYqVgzKVsx8WlrqGuo14DxJpA7KJeo1rNxalSYaugZKUSrwRkVoKYumC2kkqFApCnraGmkqbgUKEJEqlEEqnU5Kr9DwA^0|0|A|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/TryItOnline/TioSetup/wiki/Powershell" rel="nofollow noreferrer">PowerShell</a>, 16 bytes</h1>



<pre class="lang-powershell prettyprint-override"><code>2*$args[-1]%19%4
</code></pre>

<p><a href="https://tio.run/##K8gvTy0qzkjNyfmvkmZb/d9ISyWxKL04WtcwVtXQUtXkfy2XjTKXAhBYaVgpGEBYNVYKhhCWppWCEYTlYqVgzKVsx8WlrqGuo14DxJpA7KJeo1rNxalSYaugZKUSrwRkVoKYumC2kkqFApCnraGmkqbgUKEJEqlEEqnU5Kr9DwA" rel="nofollow noreferrer" title="PowerShell – Try It Online">Try it online!</a></p>

<p>PowerShell port of the modulo formula going around. Takes input via splatting</p>


blocks|key|1040808|text|Wolfram语言(Mathematica)，38个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1040809|Mod[2Last@ToCharacterCode@#,19]~Mod~4&|code-block|syntax|javascript|1040810|在网上试试！|unstyled|offset|length|1040811|这借用了乌里尔公式，它恰好与丁尔多珀氏病一样长，但我不禁想知道另一个公式是否会更短。我会调查的。|1040812|作为比较，下面是字符串索引解决方案(51个字节)：|1040813|("(%7C)D"~StringPosition~Last@Characters@#)[[1,+1]]-1&|1040814|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##y00syUjNTSzJTE78H1CUmVcS/d83PyXayCexuMQhJN85I7EoMbkktcg5PyXVQVnH0DK2DihfZ6L2X9@hWslKQ0lHyaoGRGiCCBcQoQsW1AWL6oKFdV2UamP/AwA|1|https://codegolf.stackexchange.com/a/202898/41938|2|https://codegolf.stackexchange.com/a/202907/41938|3|https://tio.run/##y00syUjNTSzJTE78H1CUmVcS/V9DSaNG00WpLrgEyE8PyC/OLMnMz6vzSSwucXDOSCxKTC5JLSp2UNaMjjbUUTCMjdU1VPuv71CtZKWhpKNkVQMiNEGEC4jQBQvqgkV1wcK6Lkq1sf8B^0|0|0|0|6|0|0|4|5|1|E|6|2|0|0|0|0|6|3^^$0|@$1|2|3|4|5|6|7|15|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|16|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|17|8|@]|9|@$J|18|K|19|1|1A]]|A|$]]|$1|L|3|M|5|I|7|1B|8|@]|9|@$J|1C|K|1D|1|1E]|$J|1F|K|1G|1|1H]]|A|$]]|$1|N|3|O|5|I|7|1I|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|1J|8|@]|9|@]|A|$E|F]]|$1|R|3|H|5|I|7|1K|8|@]|9|@$J|1L|K|1M|1|1N]]|A|$]]]|S|$T|$5|U|V|W|A|$X|Y]]|Z|$5|U|V|W|A|$X|10]]|11|$5|U|V|W|A|$X|12]]|13|$5|U|V|W|A|$X|14]]]]

<h1>Wolfram Language (Mathematica), 38 bytes</h1>
<pre><code>Mod[2Last@ToCharacterCode@#,19]~Mod~4&amp;
</code></pre>
<p><a href="https://tio.run/##y00syUjNTSzJTE78H1CUmVcS/d83PyXayCexuMQhJN85I7EoMbkktcg5PyXVQVnH0DK2DihfZ6L2X9@hWslKQ0lHyaoGRGiCCBcQoQsW1AWL6oKFdV2UamP/AwA" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>
<p>This borrows <a href="https://codegolf.stackexchange.com/a/202898/41938">Uriel's formula</a>, which happens to be the same length as <a href="https://codegolf.stackexchange.com/a/202907/41938">dingledooper's</a>, but I can't help but wonder if another formula would be shorter. I will investigate.</p>
<p>For comparison, here's the string indexing solution (51 bytes):</p>
<pre><code>(&quot;(|)D&quot;~StringPosition~Last@Characters@#)[[1, 1]]-1&amp;
</code></pre>
<p><a href="https://tio.run/##y00syUjNTSzJTE78H1CUmVcS/V9DSaNG00WpLrgEyE8PyC/OLMnMz6vzSSwucXDOSCxKTC5JLSp2UNaMjjbUUTCMjdU1VPuv71CtZKWhpKNkVQMiNEGEC4jQBQvqgkV1wcK6Lkq1sf8B" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>


blocks|key|1041140|text|MAWP，27字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1041141|%7C2W!!92W1MP92W1MWA!!4P4WA:.|code-block|syntax|javascript|1041142|试试看！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://esolangs.org/wiki/MAWP|1|https://8dion8.github.io/?code=%257C2W!!92W1MP92W1MWA!!4P4WA%253A.&input=%253A-%257C^0|0|4|0|0|0|0|4|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://esolangs.org/wiki/MAWP" rel="nofollow noreferrer">MAWP</a>, 27 bytes</h1>
<pre><code>|2W!!92W1MP92W1MWA!!4P4WA:.
</code></pre>
<p><a href="https://8dion8.github.io/?code=%7C2W!!92W1MP92W1MWA!!4P4WA%3A.&amp;input=%3A-%7C" rel="nofollow noreferrer">Try it!</a></p>


blocks|key|1034898|text|JavaScript，2335|type|header-two|depth|inlineStyleRanges|entityRanges|data|1034899|(・・?，有人说了表情符号吗？|unstyled|offset|length|style|CODE|1034900|a+=+
//+The+function:
(w)=>{(笑)=(w);ﾟωﾟﾉ=+/｀ｍ´）ﾉ+~┻━┻+++//*´∇｀*/+['_'];+o=(ﾟｰﾟ)++=_=3;+c=(ﾟΘﾟ)+=(ﾟｰﾟ)-(ﾟｰﾟ);+(ﾟДﾟ)+=(ﾟΘﾟ)=+(o%5E_%5Eo)/+(o%5E_%5Eo);(ﾟДﾟ)={ﾟΘﾟ:+'_'+,ﾟωﾟﾉ+:+((ﾟωﾟﾉ==3)+%2B'_')+[ﾟΘﾟ]+,ﾟｰﾟﾉ+:(ﾟωﾟﾉ%2B+'_')[o%5E_%5Eo+-(ﾟΘﾟ)]+,ﾟДﾟﾉ:((ﾟｰﾟ==3)+%2B'_')[ﾟｰﾟ]+};+(ﾟДﾟ)+[ﾟΘﾟ]+=((ﾟωﾟﾉ==3)+%2B'_')+[c%5E_%5Eo];(ﾟДﾟ)+['c']+=+((ﾟДﾟ)%2B'_')+[+(ﾟｰﾟ)%2B(ﾟｰﾟ)-(ﾟΘﾟ)+];(ﾟДﾟ)+['o']+=+((ﾟДﾟ)%2B'_')+[ﾟΘﾟ];(ﾟoﾟ)=(ﾟДﾟ)+['c']%2B(ﾟДﾟ)+['o']%2B(ﾟωﾟﾉ+%2B'_')[ﾟΘﾟ]%2B+((ﾟωﾟﾉ==3)+%2B'_')+[ﾟｰﾟ]+%2B+((ﾟДﾟ)+%2B'_')+[(ﾟｰﾟ)%2B(ﾟｰﾟ)]%2B+((ﾟｰﾟ==3)+%2B'_')+[ﾟΘﾟ]%2B((ﾟｰﾟ==3)+%2B'_')+[(ﾟｰﾟ)+-+(ﾟΘﾟ)]%2B(ﾟДﾟ)+['c']%2B((ﾟДﾟ)%2B'_')+[(ﾟｰﾟ)%2B(ﾟｰﾟ)]%2B+(ﾟДﾟ)+['o']%2B((ﾟｰﾟ==3)+%2B'_')+[ﾟΘﾟ];(ﾟДﾟ)+['_']+=(o%5E_%5Eo)+[ﾟoﾟ]+[ﾟoﾟ];(ﾟεﾟ)=((ﾟｰﾟ==3)+%2B'_')+[ﾟΘﾟ]%2B+(ﾟДﾟ)+.ﾟДﾟﾉ%2B((ﾟДﾟ)%2B'_')+[(ﾟｰﾟ)+%2B+(ﾟｰﾟ)]%2B((ﾟｰﾟ==3)+%2B'_')+[o%5E_%5Eo+-ﾟΘﾟ]%2B((ﾟｰﾟ==3)+%2B'_')+[ﾟΘﾟ]%2B+(ﾟωﾟﾉ+%2B'_')+[ﾟΘﾟ];+(ﾟｰﾟ)%2B=(ﾟΘﾟ);+(ﾟДﾟ)[ﾟεﾟ]='\\';+(ﾟДﾟ).ﾟΘﾟﾉ=(ﾟДﾟ%2B+ﾟｰﾟ)[o%5E_%5Eo+-(ﾟΘﾟ)];(oﾟｰﾟo)=(ﾟωﾟﾉ+%2B'_')[c%5E_%5Eo];(ﾟДﾟ)+[ﾟoﾟ]='\"';(ﾟДﾟ)+['_']+(+(ﾟДﾟ)+['_']+(ﾟεﾟ%2B(ﾟДﾟ)[ﾟoﾟ]%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(ﾟｰﾟ)%2B+(ﾟΘﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟｰﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(ﾟｰﾟ)%2B+((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((o%5E_%5Eo)+%2B(o%5E_%5Eo))%2B+((o%5E_%5Eo)+-+(ﾟΘﾟ))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((o%5E_%5Eo)+%2B(o%5E_%5Eo))%2B+(ﾟｰﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(c%5E_%5Eo)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟｰﾟ)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(c%5E_%5Eo)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(ﾟｰﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟΘﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(c%5E_%5Eo)%2B+(ﾟｰﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟｰﾟ)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+((o%5E_%5Eo)+%2B(o%5E_%5Eo))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟΘﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+((o%5E_%5Eo)+%2B(o%5E_%5Eo))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(ﾟｰﾟ)%2B+(ﾟｰﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(ﾟｰﾟ)%2B+((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(c%5E_%5Eo)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(ﾟΘﾟ)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(ﾟｰﾟ)%2B+((o%5E_%5Eo)+%2B(o%5E_%5Eo))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(c%5E_%5Eo)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(oﾟｰﾟo)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(ﾟДﾟ)+.ﾟΘﾟﾉ%2B+(ﾟΘﾟ)%2B+(ﾟΘﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(o%5E_%5Eo)%2B+(o%5E_%5Eo)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((o%5E_%5Eo)+%2B(o%5E_%5Eo))%2B+((o%5E_%5Eo)+-+(ﾟΘﾟ))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(o%5E_%5Eo)%2B+((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(ﾟｰﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(ﾟｰﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(oﾟｰﾟo)%2B+((ﾟｰﾟ)+%2B+(o%5E_%5Eo))%2B+(ﾟДﾟ)+.ﾟΘﾟﾉ%2B+(ﾟΘﾟ)%2B+(ﾟΘﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(o%5E_%5Eo)%2B+(o%5E_%5Eo)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((o%5E_%5Eo)+%2B(o%5E_%5Eo))%2B+(ﾟΘﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B(ﾟΘﾟ)%2B+(o%5E_%5Eo)%2B+((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟΘﾟ)%2B+(ﾟДﾟ)[ﾟεﾟ]%2B((ﾟｰﾟ)+%2B+(ﾟΘﾟ))%2B+(ﾟΘﾟ)%2B+(ﾟДﾟ)[ﾟoﾟ])+(ﾟΘﾟ))+('_');}
//+Execute+function:
a(':D');|code-block|syntax|javascript|1034901|我从这个答案中取出它，用aaencode对其进行编码，并将其封装为箭头函数。|entityMap|0|LINK|mutability|MUTABLE|url|https://codegolf.stackexchange.com/a/205865/91403|1|https://utf-8.jp/public/aaencode.html^0|0|0|4|0|0|2|4|0|C|8|1^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@$E|10|F|11|G|H]]|9|@]|A|$]]|$1|I|3|J|5|K|7|12|8|@]|9|@]|A|$L|M]]|$1|N|3|O|5|D|7|13|8|@]|9|@$E|14|F|15|1|16]|$E|17|F|18|1|19]]|A|$]]]|P|$Q|$5|R|S|T|A|$U|V]]|W|$5|R|S|T|A|$U|X]]]]

<h2>JavaScript, 2335</h2>
<p><code>(・・?</code> Did somebody say emoticons?</p>
<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>a = 
// The function:
(w)=&gt;{(笑)=(w);ﾟωﾟﾉ= /｀ｍ´）ﾉ ~┻━┻   //*´∇｀*/ ['_']; o=(ﾟｰﾟ)  =_=3; c=(ﾟΘﾟ) =(ﾟｰﾟ)-(ﾟｰﾟ); (ﾟДﾟ) =(ﾟΘﾟ)= (o^_^o)/ (o^_^o);(ﾟДﾟ)={ﾟΘﾟ: '_' ,ﾟωﾟﾉ : ((ﾟωﾟﾉ==3) +'_') [ﾟΘﾟ] ,ﾟｰﾟﾉ :(ﾟωﾟﾉ+ '_')[o^_^o -(ﾟΘﾟ)] ,ﾟДﾟﾉ:((ﾟｰﾟ==3) +'_')[ﾟｰﾟ] }; (ﾟДﾟ) [ﾟΘﾟ] =((ﾟωﾟﾉ==3) +'_') [c^_^o];(ﾟДﾟ) ['c'] = ((ﾟДﾟ)+'_') [ (ﾟｰﾟ)+(ﾟｰﾟ)-(ﾟΘﾟ) ];(ﾟДﾟ) ['o'] = ((ﾟДﾟ)+'_') [ﾟΘﾟ];(ﾟoﾟ)=(ﾟДﾟ) ['c']+(ﾟДﾟ) ['o']+(ﾟωﾟﾉ +'_')[ﾟΘﾟ]+ ((ﾟωﾟﾉ==3) +'_') [ﾟｰﾟ] + ((ﾟДﾟ) +'_') [(ﾟｰﾟ)+(ﾟｰﾟ)]+ ((ﾟｰﾟ==3) +'_') [ﾟΘﾟ]+((ﾟｰﾟ==3) +'_') [(ﾟｰﾟ) - (ﾟΘﾟ)]+(ﾟДﾟ) ['c']+((ﾟДﾟ)+'_') [(ﾟｰﾟ)+(ﾟｰﾟ)]+ (ﾟДﾟ) ['o']+((ﾟｰﾟ==3) +'_') [ﾟΘﾟ];(ﾟДﾟ) ['_'] =(o^_^o) [ﾟoﾟ] [ﾟoﾟ];(ﾟεﾟ)=((ﾟｰﾟ==3) +'_') [ﾟΘﾟ]+ (ﾟДﾟ) .ﾟДﾟﾉ+((ﾟДﾟ)+'_') [(ﾟｰﾟ) + (ﾟｰﾟ)]+((ﾟｰﾟ==3) +'_') [o^_^o -ﾟΘﾟ]+((ﾟｰﾟ==3) +'_') [ﾟΘﾟ]+ (ﾟωﾟﾉ +'_') [ﾟΘﾟ]; (ﾟｰﾟ)+=(ﾟΘﾟ); (ﾟДﾟ)[ﾟεﾟ]='\\'; (ﾟДﾟ).ﾟΘﾟﾉ=(ﾟДﾟ+ ﾟｰﾟ)[o^_^o -(ﾟΘﾟ)];(oﾟｰﾟo)=(ﾟωﾟﾉ +'_')[c^_^o];(ﾟДﾟ) [ﾟoﾟ]='\"';(ﾟДﾟ) ['_'] ( (ﾟДﾟ) ['_'] (ﾟεﾟ+(ﾟДﾟ)[ﾟoﾟ]+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (ﾟｰﾟ)+ (ﾟΘﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟｰﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (ﾟｰﾟ)+ ((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((o^_^o) +(o^_^o))+ ((o^_^o) - (ﾟΘﾟ))+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((o^_^o) +(o^_^o))+ (ﾟｰﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+((ﾟｰﾟ) + (ﾟΘﾟ))+ (c^_^o)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟｰﾟ)+ ((ﾟｰﾟ) + (o^_^o))+ (ﾟДﾟ)[ﾟεﾟ]+((ﾟｰﾟ) + (ﾟΘﾟ))+ (c^_^o)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((ﾟｰﾟ) + (o^_^o))+ (ﾟｰﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟΘﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (c^_^o)+ (ﾟｰﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟｰﾟ)+ ((ﾟｰﾟ) + (o^_^o))+ (ﾟДﾟ)[ﾟεﾟ]+((ﾟｰﾟ) + (ﾟΘﾟ))+ ((o^_^o) +(o^_^o))+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟΘﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((ﾟｰﾟ) + (ﾟΘﾟ))+ ((o^_^o) +(o^_^o))+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (ﾟｰﾟ)+ (ﾟｰﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (ﾟｰﾟ)+ ((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((ﾟｰﾟ) + (o^_^o))+ (c^_^o)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (ﾟΘﾟ)+ ((ﾟｰﾟ) + (o^_^o))+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (ﾟｰﾟ)+ ((o^_^o) +(o^_^o))+ (ﾟДﾟ)[ﾟεﾟ]+((ﾟｰﾟ) + (ﾟΘﾟ))+ (c^_^o)+ (ﾟДﾟ)[ﾟεﾟ]+(oﾟｰﾟo)+ ((ﾟｰﾟ) + (o^_^o))+ (ﾟДﾟ) .ﾟΘﾟﾉ+ (ﾟΘﾟ)+ (ﾟΘﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (o^_^o)+ (o^_^o)+ (ﾟДﾟ)[ﾟεﾟ]+((o^_^o) +(o^_^o))+ ((o^_^o) - (ﾟΘﾟ))+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (o^_^o)+ ((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((ﾟｰﾟ) + (o^_^o))+ (ﾟｰﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ ((ﾟｰﾟ) + (o^_^o))+ (ﾟｰﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(oﾟｰﾟo)+ ((ﾟｰﾟ) + (o^_^o))+ (ﾟДﾟ) .ﾟΘﾟﾉ+ (ﾟΘﾟ)+ (ﾟΘﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (o^_^o)+ (o^_^o)+ (ﾟДﾟ)[ﾟεﾟ]+((o^_^o) +(o^_^o))+ (ﾟΘﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+(ﾟΘﾟ)+ (o^_^o)+ ((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟДﾟ)[ﾟεﾟ]+((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟΘﾟ)+ (ﾟДﾟ)[ﾟεﾟ]+((ﾟｰﾟ) + (ﾟΘﾟ))+ (ﾟΘﾟ)+ (ﾟДﾟ)[ﾟoﾟ]) (ﾟΘﾟ)) ('_');}
// Execute function:
a(':D');</code></pre>
</div>
</div>
</p>
<p>I took it from <a href="https://codegolf.stackexchange.com/a/205865/91403">this answer</a>, encoded it with <a href="https://utf-8.jp/public/aaencode.html" rel="nofollow noreferrer">aaencode</a>, and wrapped it an the arrow function.</p>


blocks|key|1041278|text|Perl+5+-p，14字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1041279|y/(%7C)D:-/0-3/d|code-block|syntax|javascript|1041280|在网上试试！|unstyled|1041281|基本上是我的sed答案的一个端口，但是perl中的y///命令有删除额外字符和指定字符范围的附加实用程序，因此它设法更短，并且仍然包含:-/和D:作为代码的基本部分。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.perl.org/|1|https://tio.run/##K0gtyjH9r1JhqxJvzZWckZ9boKFSoWn9v1Jfo0bTxUpX30DXWD/lv7VKhZ6tkoJSaV5OanExUIltXa6@rr6mNRdEQtdOQQnIjrdVUqlQiVf6b6XBZaVbw2XlAqQ0uaxq/uUXlGTm5xX/1y0AAA|2|https://codegolf.stackexchange.com/a/211823/58834^0|7|2|0|6|0|0|0|0|6|1|0|P|4|1V|3|1Z|2|6|5|2^^$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|@$9|1C|A|1D|B|C]|$9|1E|A|1F|B|C]|$9|1G|A|1H|B|C]]|D|@$9|1I|A|1J|1|1K]]|E|$]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|R|S|T|E|$U|X]]|Y|$5|R|S|T|E|$U|Z]]]]

<h1><a href="https://www.perl.org/" rel="nofollow noreferrer">Perl 5</a> <code>-p</code>, 14 bytes</h1>

<pre class="lang-perl prettyprint-override"><code>y/(|)D:-/0-3/d
</code></pre>
<p><a href="https://tio.run/##K0gtyjH9r1JhqxJvzZWckZ9boKFSoWn9v1Jfo0bTxUpX30DXWD/lv7VKhZ6tkoJSaV5OanExUIltXa6@rr6mNRdEQtdOQQnIjrdVUqlQiVf6b6XBZaVbw2XlAqQ0uaxq/uUXlGTm5xX/1y0AAA" rel="nofollow noreferrer" title="Perl 5 – Try It Online">Try it online!</a></p>
<p>Basically a port of my <a href="https://codegolf.stackexchange.com/a/211823/58834">sed answer</a>, but the <code>y///</code> command in perl has the additional utilities of deleting extra characters and specifying ranges of characters, so this manages to be shorter and still contain <code>:-/</code> and <code>D:</code> as essential parts of the code.</p>


blocks|key|1035072|text|因子，20字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1035073|[+last+"(%7C)D"index+]|code-block|syntax|javascript|1035074|在网上试试！|unstyled|1035075|解释：|1035076|如果调用此引号时":)"在数据堆栈上.|style|CODE|1035077|last接受输入的最后一个元素。堆栈：41+()的代码点)|unordered-list-item|1035078|"(%7C)D"将字符串推送到堆栈。堆栈：41+"(%7C)D"|1035079|index在"(%7C)D"中找到41的索引。堆栈：2|entityMap|0|LINK|mutability|MUTABLE|url|https://factorcode.org/|1|https://tio.run/##S0tMLskv@h8a7OnnbqVQnFpYmpqXnFqsUFCUWlJSWVCUmVeiUFiuYM3FVVhezaUABFYaEEq3BkK7QLmaELqGq/Z/tEJOYnGJgpJGjaaLUmZeSmqFQuz/3MQCheKSxORsvf8A^0|0|2|0|0|0|0|6|1|0|0|8|4|0|0|4|J|2|N|1|0|0|6|J|9|0|0|5|6|6|F|2|O|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|6|7|1G|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1H|8|@$A|1I|B|1J|P|Q]]|9|@]|C|$]]|$1|R|3|S|5|T|7|1K|8|@$A|1L|B|1M|P|Q]|$A|1N|B|1O|P|Q]|$A|1P|B|1Q|P|Q]]|9|@]|C|$]]|$1|U|3|V|5|T|7|1R|8|@$A|1S|B|1T|P|Q]|$A|1U|B|1V|P|Q]]|9|@]|C|$]]|$1|W|3|X|5|T|7|1W|8|@$A|1X|B|1Y|P|Q]|$A|1Z|B|20|P|Q]|$A|21|B|22|P|Q]|$A|23|B|24|P|Q]]|9|@]|C|$]]]|Y|$Z|$5|10|11|12|C|$13|14]]|15|$5|10|11|12|C|$13|16]]]]

<h1><a href="https://factorcode.org/" rel="nofollow noreferrer">Factor</a>, 20 bytes</h1>
<pre><code>[ last &quot;(|)D&quot;index ]
</code></pre>
<p><a href="https://tio.run/##S0tMLskv@h8a7OnnbqVQnFpYmpqXnFqsUFCUWlJSWVCUmVeiUFiuYM3FVVhezaUABFYaEEq3BkK7QLmaELqGq/Z/tEJOYnGJgpJGjaaLUmZeSmqFQuz/3MQCheKSxORsvf8A" rel="nofollow noreferrer" title="Factor – Try It Online">Try it online!</a></p>
<h2>Explanation:</h2>
<p>If <code>&quot;:)&quot;</code> is on the data stack when this quotation is called...</p>
<ul>
<li><p><code>last</code> Take the last element of the input.</p>
<p><strong>Stack:</strong> <code>41</code> (code point for <code>)</code>)</p>
</li>
<li><p><code>&quot;(|)D&quot;</code> Push a string to the stack.</p>
<p><strong>Stack:</strong> <code>41 &quot;(|)D&quot;</code></p>
</li>
<li><p><code>index</code> Find the index of <code>41</code> in <code>&quot;(|)D&quot;</code>.</p>
<p><strong>Stack:</strong> <code>2</code></p>
</li>
</ul>


blocks|key|1035156|text|维沙尔+K，7字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1035157|td19%254%25|code-block|syntax|javascript|1035158|在网上试试！+-1多亏了exedraj。|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Vyxal/Vyxal|1|https://lyxal.pythonanywhere.com/?flags=K&code=td19%25254%2525&inputs=%253A-D&header=&footer=^0|4|1|0|3|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|W|8|@$9|X|A|Y|B|C]]|D|@$9|Z|A|10|1|11]]|E|$]]|$1|F|3|G|5|H|7|12|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|13|8|@]|D|@$9|14|A|15|1|16]]|E|$]]]|N|$O|$5|P|Q|R|E|$S|T]]|U|$5|P|Q|R|E|$S|V]]]]

<h1><a href="https://github.com/Vyxal/Vyxal" rel="nofollow noreferrer">Vyxal</a> <code>K</code>, 7 bytes</h1>
<pre><code>td19%4%
</code></pre>
<p><a href="https://lyxal.pythonanywhere.com?flags=K&amp;code=td19%254%25&amp;inputs=%3A-D&amp;header=&amp;footer=" rel="nofollow noreferrer">Try it Online!</a>
-1 thanks to exedraj.</p>


blocks|key|1041559|text|脑盘，94字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1041560|,[[>%2B%2B<-]>>,]>%2B%2B%2B%2B[<%2B%2B%2B%2B>-]<[%2B%2B%2B<[>->%2B<[>]>[<%2B>-]<<[<]>-]>[-]<<<[>>>>>%2B<<]>>]>-[>%2B<-----]>---.|code-block|syntax|javascript|1041561|在网上试试！|unstyled|1041562|使用乌里尔公式。下面是它的工作原理：|1041563|,[[>%2B%2B<-]>>,]|1041564|一个漂亮的输入循环，它处理可选的鼻子并使字符加倍。它得到一个字符，将其加倍进入下一个单元格，然后移动两个单元格并尝试获取另一个字符。最后，带子看起来就像|1041565|0+2*c1+0+2*c2+0+2*c3+0+...
+++++++++++++++++++++%5E|1041566|这需要一个带有EOF=0或没有更改的实现(这占了其中的大多数，包括TIO)。|1041567|>%2B%2B%2B%2B[<%2B%2B%2B%2B>-]<|1041568|在最后一次双倍输入后放16。现在转到主循环：|1041569|[%2B%2B%2B<[>->%2B<[>]>[<%2B>-]<<[<]>-]>[-]<<<[>>>>>%2B<<]>>]|1041570|这个循环会|1041571|在红利(当前单元格)中添加3。我这么做是因为得到16比19短2个字节，这些可以被重复使用来构造第二个红利的4。|unordered-list-item|1041572|计算前一%25电流单元的模数。|1041573|清除临时变量|1041574|检查单元格3索引返回的值是否为非零(这仅在第一次迭代时为真，因为循环结束了开始位置右侧的2个索引)。如果是，增加下一个红利所在的单元格(这将设置第二个模块4)。|1041575|为了清晰起见，下面是第一次迭代期间，在清理tempvar之前磁带的样子：|1041576|0+2*c1+0+2*c2+0+0+tmp+2*c3%2519+0+...
++++++++++++++++++%5E|1041577|第二种情况也是如此：|1041578|0+2*c1+0+2*c2+0+0+0+0+tmp+2*c3%2519%254+0+...
++++++++++++++++++++++%5E|1041579|因此，检查单元3索引返回是一种简单的方法，可以查看我们正在进行的迭代，而无需使用计数器。|1041580|>-[>%2B<-----]>---.|1041581|最后，一些包装滥用，以增加48的结果，以便它可以输出。|1041582|可能还有改进的余地，特别是在输入循环或内存布局方面，但这是我能想到的最好的。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/TryItOnline/brainfuck|1|https://tio.run/##FYzBCYBQDEMHqnEACTm5RelBBUEED4Lzf9MckkdSur/b9ZzfcY8xZSqCKGkqU0SyXSimkymoveShWybLqWz20Aq68wn8jGiZgXmMBesP|2|https://codegolf.stackexchange.com/a/202898/41938^0|0|2|0|0|0|0|6|1|0|2|5|2|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|23|8|@]|9|@$A|24|B|25|1|26]]|C|$]]|$1|D|3|E|5|F|7|27|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|28|8|@]|9|@$A|29|B|2A|1|2B]]|C|$]]|$1|L|3|M|5|K|7|2C|8|@]|9|@$A|2D|B|2E|1|2F]]|C|$]]|$1|N|3|O|5|F|7|2G|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|2H|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|2I|8|@]|9|@]|C|$G|H]]|$1|T|3|U|5|K|7|2J|8|@]|9|@]|C|$]]|$1|V|3|W|5|F|7|2K|8|@]|9|@]|C|$G|H]]|$1|X|3|Y|5|K|7|2L|8|@]|9|@]|C|$]]|$1|Z|3|10|5|F|7|2M|8|@]|9|@]|C|$G|H]]|$1|11|3|12|5|K|7|2N|8|@]|9|@]|C|$]]|$1|13|3|14|5|15|7|2O|8|@]|9|@]|C|$]]|$1|16|3|17|5|15|7|2P|8|@]|9|@]|C|$]]|$1|18|3|19|5|15|7|2Q|8|@]|9|@]|C|$]]|$1|1A|3|1B|5|15|7|2R|8|@]|9|@]|C|$]]|$1|1C|3|1D|5|K|7|2S|8|@]|9|@]|C|$]]|$1|1E|3|1F|5|F|7|2T|8|@]|9|@]|C|$G|H]]|$1|1G|3|1H|5|K|7|2U|8|@]|9|@]|C|$]]|$1|1I|3|1J|5|F|7|2V|8|@]|9|@]|C|$G|H]]|$1|1K|3|1L|5|K|7|2W|8|@]|9|@]|C|$]]|$1|1M|3|1N|5|F|7|2X|8|@]|9|@]|C|$G|H]]|$1|1O|3|1P|5|K|7|2Y|8|@]|9|@]|C|$]]|$1|1Q|3|1R|5|K|7|2Z|8|@]|9|@]|C|$]]]|1S|$1T|$5|1U|1V|1W|C|$1X|1Y]]|1Z|$5|1U|1V|1W|C|$1X|20]]|21|$5|1U|1V|1W|C|$1X|22]]]]

<h1><a href="https://github.com/TryItOnline/brainfuck" rel="nofollow noreferrer">brainfuck</a>, 94 bytes</h1>
<pre><code>,[[&gt;++&lt;-]&gt;&gt;,]&gt;++++[&lt;++++&gt;-]&lt;[+++&lt;[&gt;-&gt;+&lt;[&gt;]&gt;[&lt;+&gt;-]&lt;&lt;[&lt;]&gt;-]&gt;[-]&lt;&lt;&lt;[&gt;&gt;&gt;&gt;&gt;+&lt;&lt;]&gt;&gt;]&gt;-[&gt;+&lt;-----]&gt;---.
</code></pre>
<p><a href="https://tio.run/##FYzBCYBQDEMHqnEACTm5RelBBUEED4Lzf9MckkdSur/b9ZzfcY8xZSqCKGkqU0SyXSimkymoveShWybLqWz20Aq68wn8jGiZgXmMBesP" rel="nofollow noreferrer" title="brainfuck – Try It Online">Try it online!</a></p>
<p>Uses <a href="https://codegolf.stackexchange.com/a/202898/41938">Uriel's formula</a>. Here's how it works:</p>
<pre><code>,[[&gt;++&lt;-]&gt;&gt;,]
</code></pre>
<p>A nifty input loop that handles the optional nose and doubling the characters. It gets a character, doubles it into the next cell, then moves two cells over and tries to get another character. At the end, the tape looks something like</p>
<pre><code>0 2*c1 0 2*c2 0 2*c3 0 ...
                     ^
</code></pre>
<p>This requires an implementation with EOF=0 or no change (which accounts for most of them including TIO).</p>
<pre><code>&gt;++++[&lt;++++&gt;-]&lt;
</code></pre>
<p>Put 16 after the last doubled input. Now on to the main loop:</p>
<pre><code>[+++&lt;[&gt;-&gt;+&lt;[&gt;]&gt;[&lt;+&gt;-]&lt;&lt;[&lt;]&gt;-]&gt;[-]&lt;&lt;&lt;[&gt;&gt;&gt;&gt;&gt;+&lt;&lt;]&gt;&gt;]
</code></pre>
<p>This loop will</p>
<ul>
<li>add 3 to the dividend (current cell). I do this because it's 2 bytes shorter to get 16 rather than 19, and these can be reused to construct 4 for the second dividend.</li>
<li>compute the modulus of the previous%current cell.</li>
<li>clear out a temporary variable</li>
<li>check if the value of the cell 3 indices back is non-zero (which is only true on the first iteration since the loop ends 2 indices to the right of where it started). If it is, increment the cell where the next dividend will be (this sets up the second modulo 4).</li>
</ul>
<p>For clarity, here's what the tape looks like during the first iteration, before the tempvar is cleaned:</p>
<pre><code>0 2*c1 0 2*c2 0 0 tmp 2*c3%19 0 ...
                  ^
</code></pre>
<p>And the same for the second:</p>
<pre><code>0 2*c1 0 2*c2 0 0 0 0 tmp 2*c3%19%4 0 ...
                      ^
</code></pre>
<p>So checking the cell 3 indices back is an easy way to see which iteration we're on without using a counter.</p>
<pre><code>&gt;-[&gt;+&lt;-----]&gt;---.
</code></pre>
<p>And finally, a bit of wrapping abuse to add 48 to the result so it can be outputted.</p>
<p>There's probably room for improvement, particularly in the input loop or the memory layout, but this is the best I could come up with.</p>


blocks|key|1034465|text|T，34个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1034466|SELECT+CHARINDEX(RIGHT(@,1),'%7C)D')-1|code-block|syntax|javascript|1034467|要求声明变量@并分配输入。|unstyled|offset|length|style|CODE|1034468|此代码接受最正确的字符，并搜索可能的嘴的索引列表。CHARINDEX返回一个基于1的索引.但是，找不到任何东西就会返回0。因此，我们把皱眉从搜索线中去掉(使悲伤的脸更加悲伤)。|1034469|在网上试试！(SQL+Fiddle)|entityMap|0|LINK|mutability|MUTABLE|url|http://sqlfiddle.com/#!18/9eecb/81684^0|0|0|6|1|0|P|9|0|0|I|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|10|8|@$J|11|K|12|L|M]]|9|@]|A|$]]|$1|N|3|O|5|I|7|13|8|@$J|14|K|15|L|M]]|9|@]|A|$]]|$1|P|3|Q|5|I|7|16|8|@]|9|@$J|17|K|18|1|19]]|A|$]]]|R|$S|$5|T|U|V|A|$W|X]]]]

<h1>T-SQL, 34 bytes</h1>

<pre><code>SELECT CHARINDEX(RIGHT(@,1),'|)D')-1
</code></pre>

<p>Requires the variable <code>@</code> to be declared and assigned the input.</p>

<p>This code takes the right most character, and searches an indexed list of the possible mouthes. <code>CHARINDEX</code> returns a 1-based index. <em>But</em>, failing to find anything returns 0. So we leave the frown out of the search string (making the sad face even sadder).</p>

<p><a href="http://sqlfiddle.com/#!18/9eecb/81684" rel="nofollow noreferrer">Try it online! (SQL Fiddle)</a></p>


blocks|key|1040570|text|为什么？，33字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1040571|(fn[s](%25(%25(*(ord(last+s))2)19)4))|code-block|syntax|javascript|1040572|在网上试试！|unstyled|1040573|它是乌里尔的回答的基本端口。我可能可以通过去掉一个%25来缩短它，但是我需要使用语法。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/hylang/hy|1|https://tio.run/##PYqxCgIxEER7v2JZEHYEC8XGra/3A2KKAxUDZwyXveME/z2uFjIwM/De/dWkXm2mhWRI1UgefWlyy6FGWXs28hwvMvSOKrDH7ogD0AKrMLFu39/G73YcAaykjCkbccplMqWgQq6RwqeL53yazAH/xQXtAw|2|https://codegolf.stackexchange.com/a/202898/94080^0|0|4|0|0|0|0|6|1|0|P|1|2|6|2^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@$A|1A|B|1B|N|O]]|9|@$A|1C|B|1D|1|1E]]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]|Y|$5|R|S|T|C|$U|Z]]]]

<h2><a href="https://github.com/hylang/hy" rel="nofollow noreferrer">Hy</a>, 33 bytes</h2>

<pre><code>(fn[s](%(%(*(ord(last s))2)19)4))
</code></pre>

<p><a href="https://tio.run/##PYqxCgIxEER7v2JZEHYEC8XGra/3A2KKAxUDZwyXveME/z2uFjIwM/De/dWkXm2mhWRI1UgefWlyy6FGWXs28hwvMvSOKrDH7ogD0AKrMLFu39/G73YcAaykjCkbccplMqWgQq6RwqeL53yazAH/xQXtAw" rel="nofollow noreferrer">Try it online!</a></p>

<p>It's a basic port of <a href="https://codegolf.stackexchange.com/a/202898/94080">Uriel's answer</a>. I might be able to shorten it by getting rid of a <code>%</code> but I need to play around with the syntax.</p>


blocks|key|1034756|text|MAWP+0.1，27字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1034757|%7C2W!!99M1MP99M1MWA!!4P4WA:.|code-block|syntax|javascript|1034758|使用“Uriel”S答案中的模公式|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://esolang.com/wiki/MAWP^0|0|8|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|F|7|W|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|X|8|@]|9|@]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]]]

<h1><a href="https://esolang.com/wiki/MAWP" rel="nofollow noreferrer">MAWP 0.1</a>, 27 bytes</h1>
<pre><code>|2W!!99M1MP99M1MWA!!4P4WA:.
</code></pre>
<p>Uses the modulo formula from @Uriel 's answer</p>


blocks|key|1041399|text|戈尔夫脚本，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1041400|-1='(%7C)D'?|code-block|syntax|javascript|1041401|在网上试试！|unstyled|1041402|解释：|1041403|-1=++++++++#+Gets+the+ASCII+value+of+the+final+character.+
+++'(%7C)D'?+#+Finds+the+index+of+that+ASCII+value,+in+the+string+'(%7C)D'.+|1041404|然后，隐式打印索引值。|entityMap|0|LINK|mutability|MUTABLE|url|http://www.golfscript.com/golfscript/index.html|1|https://tio.run/##S8/PSStOLsosKPn/X9fQVl2jRtNF3f7/fytdFwA^0|0|5|0|0|0|0|6|1|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|6|7|19|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1A|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|1B|8|@]|9|@]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="http://www.golfscript.com/golfscript/index.html" rel="nofollow noreferrer">Golfscript</a>, 10 bytes</h1>
<pre><code>-1='(|)D'?
</code></pre>
<p><a href="https://tio.run/##S8/PSStOLsosKPn/X9fQVl2jRtNF3f7/fytdFwA" rel="nofollow noreferrer">Try It Online!</a></p>
<h2>Explanation:</h2>
<pre><code>-1=        # Gets the ASCII value of the final character. 
   '(|)D'? # Finds the index of that ASCII value, in the string '(|)D'. 
</code></pre>
<p>And then, the index value is implicitly printed.</p>


<p>In this challenge, submissions will be programs or function which, when given an emoticon such as <code>:-)</code>, <code>:(</code>, or <code>:D</code>, will rate their happiness from 0 to 3.</p>

<p>An emoticon will be one of the following:</p>

<ul>
<li><code>:(</code>: 0</li>
<li><code>:|</code>: 1</li>
<li><code>:)</code>: 2</li>
<li><code>:D</code>: 3</li>
</ul>

<p>Emoticons may also have noses (a <code>-</code> after the <code>:</code>).</p>

<p>Test cases:</p>

<pre><code>:(  -&gt; 0
:-| -&gt; 1
:D  -&gt; 3
:-) -&gt; 2
:|  -&gt; 1
</code></pre>

<p>This is a code golf challenge, shortest answer per language wins.</p>


How happy is this emoticon?

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

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

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

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

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯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编辑器全新改版上线，欢迎大家体验!

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

社区新版编辑器体验调研

在这个挑战中，提交将是程序或函数，当给出一个表情，如:-)，:(，或:D时，他们的幸福感将从0到3。表情符号将是以下内容之一：:(：0:|：1:)：2:D：3表情符号也可能有鼻子( -后面的:)。测试用例：:(  -> 0:-| -> 1:D  -> 3:-) -> 2:|  -> 1这是一个代码高尔夫挑战，最短的答案每种语言获胜。

问这个表情有多开心？
EN

回答 33

Code Golf用户

Python 3，26字节

Code Golf用户

红宝石，20字节

Code Golf用户

Python 3，25字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问这个表情有多开心？EN

回答 33

Code Golf用户

Python 3，26字节

Code Golf用户

红宝石，20字节

Code Golf用户

Python 3，25字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问这个表情有多开心？
EN