blocks|key|1139874|text|05AB1E，6字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1139875|代码：|1139876|ā>%25JRQ|code-block|syntax|javascript|1139877|使用05AB1E编码。在网上试试！|unstyled|1139878|解释：|1139879|ā++++++++#+Get+the+range+[1+..+len(input)]
+>+++++++#+Increment+by+1
++%25++++++#+Vectorized+modulo
+++J+++++#+Join+the+array+into+a+single+number
++++RQ+++#+Reverse+that+number+and+check+if+it's+equal+to+the+original+input|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://tio.run/##MzBNTDJM/f//SKOdqldQ4P//JmZGBgZGBgA^0|0|6|0|0|0|0|B|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://github.com/Adriandmen/05AB1E" rel="noreferrer">05AB1E</a>, 6 bytes</h1>
<h3>Code:</h3>
<pre><code>ā&gt;%JRQ
</code></pre>
<p>Uses the <strong>05AB1E</strong> encoding. <a href="https://tio.run/##MzBNTDJM/f//SKOdqldQ4P//JmZGBgZGBgA" rel="noreferrer" title="05AB1E – Try It Online">Try it online!</a></p>
<h3>Explanation:</h3>
<pre><code>ā        # Get the range [1 .. len(input)]
 &gt;       # Increment by 1
  %      # Vectorized modulo
   J     # Join the array into a single number
    RQ   # Reverse that number and check if it's equal to the original input
</code></pre>


blocks|key|1140225|text|Python+2，54字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1140226|f=lambda+n,x=0:10**x>n+or(`n%25(x%2B2)`==`n`[~x])*f(n,x%2B1)|code-block|syntax|javascript|1140227|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##DcrRCsIgFAbg@57iv4l5nMX0cuBeJAKNsoR2HOKFY6xXt33X37KWT2LTWrBfPz@eHqyqHUY9SFknRsrC8VnU3pCz1rG7/eqdZBBH6zW1kDIiIiN7fr@EVjCaxhOw5MgF3bbjMmHbu@sxZ19EVAgiErU/^0|0|8|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

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



<pre class="lang-python prettyprint-override"><code>f=lambda n,x=0:10**x&gt;n or(`n%(x+2)`==`n`[~x])*f(n,x+1)
</code></pre>

<p><a href="https://tio.run/##DcrRCsIgFAbg@57iv4l5nMX0cuBeJAKNsoR2HOKFY6xXt33X37KWT2LTWrBfPz@eHqyqHUY9SFknRsrC8VnU3pCz1rG7/eqdZBBH6zW1kDIiIiN7fr@EVjCaxhOw5MgF3bbjMmHbu@sxZ19EVAgiErU/" rel="noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>


blocks|key|3422|text|Haskell，60字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|3423|取数字为int|unstyled|3424|x+n%7Cs<-show+n=reverse+s==(rem+n.(%2B1)<A2gt;[1..length+s]>>=show)|code-block|syntax|javascript|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|M|8|@]|9|@]|A|$H|I]]]|J|$]]

<h1>Haskell, 60 bytes</h1>

<p>Takes the number as an int</p>

<pre><code>x n|s&lt;-show n=reverse s==(rem n.(+1)&lt;$&gt;[1..length s]&gt;&gt;=show)
</code></pre>


blocks|key|3053|text|Mathematica，60字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|3054|FromDigits@Reverse@Mod[#,Range@Length@IntegerDigits@#%2B1]==#&|code-block|syntax|javascript|3055|在网上试试！|unstyled|offset|length|3056|@阿来佛法把它打到48。|3057|Mathematica，48字节|3058|FromDigits@Reverse@Mod[#,Range[2,Log10@#%2B2]]==#&|3059|下一个是24120020|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##y00sychMLv6fZvvfrSg/1yUzPbOk2CEotSy1qDjVwTc/JVpZJygxLz3VwSc1L70kw8EzryQ1PbUIqlBZ2zDW1lZZ7X9AUWZeiYKDQpqCg6GRgYmBkaHBfwA^0|0|0|0|6|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|11|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|12|8|@]|9|@$J|13|K|14|1|15]]|A|$]]|$1|L|3|M|5|I|7|16|8|@]|9|@]|A|$]]|$1|N|3|O|5|6|7|17|8|@]|9|@]|A|$]]|$1|P|3|Q|5|D|7|18|8|@]|9|@]|A|$E|F]]|$1|R|3|S|5|I|7|19|8|@]|9|@]|A|$]]]|T|$U|$5|V|W|X|A|$Y|Z]]]]

<h1>Mathematica, 60 bytes</h1>
<pre><code>FromDigits@Reverse@Mod[#,Range@Length@IntegerDigits@#+1]==#&amp;
</code></pre>
<p><a href="https://tio.run/##y00sychMLv6fZvvfrSg/1yUzPbOk2CEotSy1qDjVwTc/JVpZJygxLz3VwSc1L70kw8EzryQ1PbUIqlBZ2zDW1lZZ7X9AUWZeiYKDQpqCg6GRgYmBkaHBfwA" rel="nofollow noreferrer" title="Mathics – Try It Online">Try it online!</a></p>
<p>@alephalpha golfed it to 48</p>
<h1>Mathematica, 48 bytes</h1>
<pre><code>FromDigits@Reverse@Mod[#,Range[2,Log10@#+2]]==#&amp;
</code></pre>
<p>next one is 24120020</p>


blocks|key|1139935|text|内姆，6字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1139936|ᛖ|code-block|syntax|javascript|1139937|解释：|unstyled|1139938|+++++++++Get+the+length+of+the+input,+then+create+an+exclusive+range
+ᛖ++++++++Add+2+to+each+element
+++++++++Modulus
++++++++++Reverse
++++++++++Join
+++++++++Check+for+equality|1139939|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/okx-code/Neim|1|https://tio.run/##y0vNzP3//8PcCcsfzp72Ye7UFiBzNRAv/jB3yp7//w0NAA^0|0|2|0|0|0|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|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@]|C|$]]|$1|L|3|M|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/okx-code/Neim" rel="nofollow noreferrer">Neim</a>, 6 bytes</h1>

<pre><code>ᛖ
</code></pre>

<p>Explanation:</p>

<pre><code>         Get the length of the input, then create an exclusive range
 ᛖ        Add 2 to each element
         Modulus
          Reverse
          Join
         Check for equality
</code></pre>

<p><a href="https://tio.run/##y0vNzP3//8PcCcsfzp72Ye7UFiBzNRAv/jB3yp7//w0NAA" rel="nofollow noreferrer" title="Neim – Try It Online">Try it online!</a></p>


blocks|key|1139836|text|果冻，7字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1139837|DJ‘⁸%25⁼Ṛ|code-block|syntax|javascript|1139838|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/##y0rNyan8/9/F61HDjEeNO1QfNe55uHPW////zY0MDY0NDQE^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/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a>, 7 bytes</h1>

<pre><code>DJ‘⁸%⁼Ṛ
</code></pre>

<p><a href="https://tio.run/##y0rNyan8/9/F61HDjEeNO1QfNe55uHPW////zY0MDY0NDQE" rel="nofollow noreferrer" title="Jelly – Try It Online">Try it online!</a></p>


blocks|key|3230|text|皮斯，13字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|3231|-1字节，多亏了奥克斯。|unstyled|3232|qsjk_m%25QhdSl`|code-block|syntax|javascript|3233|在网上试试！|3234|解释|3235|+++++++++++++QQ++++#+Implicit+input
++++++++++Sl`Q+++++#+Generate+[1,+len(str(Q))]
+++++m%25Qhd+++++++++#+For+digit+d+in+above+range,+perform+Q+%25+(d+%2B+1)
+sjk_++++++++++++++#+Reverse,+then+convert+to+number
q+++++++++++++Q++++#+Test+equality+with+input|3236|替代解决方案，仍然有13个字节(多亏了卡拉克斯特)|3237|qi_.e%25Q%2B2k`QT|3238|在网上试试！本质上与第一个解决方案相同，但它使用i将数字数组转换为数字，并且范围是不同的。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/isaacg1/pyth|1|https://codegolf.stackexchange.com/users/26600/okx|2|https://pyth.herokuapp.com/?code=qsjk_m%2525QhdSl%2560&input=7211311&debug=0|3|https://codegolf.stackexchange.com/users/56557/karlkastor|4|https://pyth.herokuapp.com/?code=qi_.e%2525Q%252B2k%2560QT&input=7211311&debug=0^0|0|2|0|0|8|3|1|0|0|0|6|2|0|0|0|J|5|3|0|0|O|1|0|6|4^^$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|@$A|1J|B|1K|1|1L]]|C|$]]|$1|G|3|H|5|I|7|1M|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|1N|8|@]|9|@$A|1O|B|1P|1|1Q]]|C|$]]|$1|N|3|O|5|6|7|1R|8|@]|9|@]|C|$]]|$1|P|3|Q|5|I|7|1S|8|@]|9|@]|C|$J|K]]|$1|R|3|S|5|F|7|1T|8|@]|9|@$A|1U|B|1V|1|1W]]|C|$]]|$1|T|3|U|5|I|7|1X|8|@]|9|@]|C|$J|K]]|$1|V|3|W|5|F|7|1Y|8|@$A|1Z|B|20|X|Y]]|9|@$A|21|B|22|1|23]]|C|$]]]|Z|$10|$5|11|12|13|C|$14|15]]|16|$5|11|12|13|C|$14|17]]|18|$5|11|12|13|C|$14|19]]|1A|$5|11|12|13|C|$14|1B]]|1C|$5|11|12|13|C|$14|1D]]]]

<h1><a href="https://github.com/isaacg1/pyth" rel="nofollow noreferrer">Pyth</a>, 13 bytes</h1>

<p>-1 bytes thanks to <a href="https://codegolf.stackexchange.com/users/26600/okx">Okx</a>.</p>

<pre><code>qsjk_m%QhdSl`
</code></pre>

<p><a href="https://pyth.herokuapp.com/?code=qsjk_m%25QhdSl%60&amp;input=7211311&amp;debug=0" rel="nofollow noreferrer">Try it online!</a></p>

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

<pre><code>             QQ    # Implicit input
          Sl`Q     # Generate [1, len(str(Q))]
     m%Qhd         # For digit d in above range, perform Q % (d + 1)
 sjk_              # Reverse, then convert to number
q             Q    # Test equality with input
</code></pre>

<p><strong>Alternate solution</strong>, still 13 bytes (thanks to <a href="https://codegolf.stackexchange.com/users/56557/karlkastor">karlkastor</a>)</p>

<pre><code>qi_.e%Q+2k`QT
</code></pre>

<p><a href="https://pyth.herokuapp.com/?code=qi_.e%25Q%2B2k%60QT&amp;input=7211311&amp;debug=0" rel="nofollow noreferrer">Try it online!</a> That's essentially the same as the first solution, excepted that it uses <code>i</code> to convert from array of numbers to a number, and that the range is generated differently.</p>


blocks|key|1140193|text|Python+2，56字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1140194|lambda+x:all(`x%25(i%2B2)`==`x`[~i]for+i+in+range(len(`x`)))|code-block|syntax|javascript|1140195|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##K6gsycjPM/qfll@kkKmQmaeQlplTklqkofE/JzE3KSVRocIqMSdHI6FCVSNT20gzwdY2oSIhui4zFq6hKDEvPVUjJzUPqChBU1Pzv6YOVMzQAAw0Na24FICgoCgzr0Qh8/9/AA^0|0|8|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

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



<pre class="lang-python prettyprint-override"><code>lambda x:all(`x%(i+2)`==`x`[~i]for i in range(len(`x`)))
</code></pre>

<p><a href="https://tio.run/##K6gsycjPM/qfll@kkKmQmaeQlplTklqkofE/JzE3KSVRocIqMSdHI6FCVSNT20gzwdY2oSIhui4zFq6hKDEvPVUjJzUPqChBU1Pzv6YOVMzQAAw0Na24FICgoCgzr0Qh8/9/AA" rel="nofollow noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>


blocks|key|1140362|text|C%2B%2B,104字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1140363|(+1)原文：|unstyled|1140364|int+main(){int+N,T,R=1;cin>>N;T=N;for(int+i=1;i<=log10(N)%2B1;i%2B%2B){if(N%25(i%2B1)!=T%2510){R=0;}T/=10;}cout<<R;}|code-block|syntax|javascript|1140365|(+2)以可读的形式：|1140366|int+main()
{
++++int+N,+T,+R+=+1;

++++cin+>>+N;
++++T+=+N;

++++for+(int+i+=+1;+i+<=+log10(N)+%2B+1;+i%2B%2B)
++++{
++++++++if+(N+%25+(i+%2B+1)+!=+T+%25+10)
++++++++{
++++++++++++R+=+0;
++++++++}

++++++++T+/=+10;
++++}

++++cout+<<+R;
}|1140367|在网上试试！|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##RYtNDoMgGET3noKmMYFgU1nzcwQWhgsQRPslBYzgynh2iquu5s2bjNu21@pcfUJ032P2SEDKZfc2qO7vXLDlo7ojQ1xRtMHnzTqPcpl5hVhQsBAxOW/UgxkmybiDqJTmRmq@pB3fEzQNQn7TykasCW2N0vZasO4xUEYe0vRsJOckR36Zt2QtXDqKEBO/amU/^0|0|0|0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|10|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|D|7|11|8|@]|9|@]|A|$]]|$1|L|3|M|5|G|7|12|8|@]|9|@]|A|$H|I]]|$1|N|3|O|5|D|7|13|8|@]|9|@$P|14|Q|15|1|16]]|A|$]]]|R|$S|$5|T|U|V|A|$W|X]]]]

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



<p>1) original version:</p>

<pre class="lang-cpp prettyprint-override"><code>int main(){int N,T,R=1;cin&gt;&gt;N;T=N;for(int i=1;i&lt;=log10(N)+1;i++){if(N%(i+1)!=T%10){R=0;}T/=10;}cout&lt;&lt;R;}
</code></pre>

<p>2) in a readable form:</p>

<pre class="lang-cpp prettyprint-override"><code>int main()
{
    int N, T, R = 1;

    cin &gt;&gt; N;
    T = N;

    for (int i = 1; i &lt;= log10(N) + 1; i++)
    {
        if (N % (i + 1) != T % 10)
        {
            R = 0;
        }

        T /= 10;
    }

    cout &lt;&lt; R;
}
</code></pre>

<p><a href="https://tio.run/##RYtNDoMgGET3noKmMYFgU1nzcwQWhgsQRPslBYzgynh2iquu5s2bjNu21@pcfUJ032P2SEDKZfc2qO7vXLDlo7ojQ1xRtMHnzTqPcpl5hVhQsBAxOW/UgxkmybiDqJTmRmq@pB3fEzQNQn7TykasCW2N0vZasO4xUEYe0vRsJOckR36Zt2QtXDqKEBO/amU/" rel="nofollow noreferrer">Try it Online!</a></p>


blocks|key|1139901|text|帕里/GP，42字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1139902|n->Vecrev(s=digits(n))==[n%25d%7Cd<-[2..#s%2B1]]|code-block|syntax|javascript|1139903|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://pari.math.u-bordeaux.fr/|1|https://tio.run/##K0gsytRNL/ifpmCr8D9P1y4sNbkotUyj2DYlMz2zpFgjT1PT1jY6TzWlJsVGN9pIT0@5WNswNvZ/Wn6RRh5Qj6GOgqGBgY5CQVFmXglQRElB1w5IpIE0av4HAA^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>, 42 bytes</h1>

<pre><code>n-&gt;Vecrev(s=digits(n))==[n%d|d&lt;-[2..#s+1]]
</code></pre>

<p><a href="https://tio.run/##K0gsytRNL/ifpmCr8D9P1y4sNbkotUyj2DYlMz2zpFgjT1PT1jY6TzWlJsVGN9pIT0@5WNswNvZ/Wn6RRh5Qj6GOgqGBgY5CQVFmXglQRElB1w5IpIE0av4HAA" rel="nofollow noreferrer" title="Pari/GP – Try It Online">Try it online!</a></p>


blocks|key|3708|text|Python+3:+63+Bytes|type|header-two|depth|inlineStyleRanges|entityRanges|data|3709|lambda+m:all(int(x)==m%25(n%2B2)for+n,x+in+enumerate(str(m)[::-1]))|code-block|syntax|javascript|3710|如果我能数出我希望“枚举”更短的次数.|unstyled|3711|在网上试试！|offset|length|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##FctBCoAgEADAr@wl2KWCrJvgS6KDkVHgrqIG9Xqr4xwmPuUIMtWajbe8bhZYW@/xlII3GcMNSjsS7CGBdDecAk4udskWh7kkZJq17tVCVGP6V0alBvXxBQ^0|0|0|0|0|6|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|W|8|@]|9|@]|A|$]]|$1|J|3|K|5|I|7|X|8|@]|9|@$L|Y|M|Z|1|10]]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

<h1>Python 3: 63 Bytes</h1>
<pre><code>lambda m:all(int(x)==m%(n+2)for n,x in enumerate(str(m)[::-1]))
</code></pre>
<p>If I could count the number of times I wished 'enumerate' were shorter...</p>
<p><a href="https://tio.run/##FctBCoAgEADAr@wl2KWCrJvgS6KDkVHgrqIG9Xqr4xwmPuUIMtWajbe8bhZYW@/xlII3GcMNSjsS7CGBdDecAk4udskWh7kkZJq17tVCVGP6V0alBvXxBQ" rel="nofollow noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>


blocks|key|3799|text|哈斯克尔，53字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|3800|f+n=foldr(\(k,_)a->10*a%2Bmod+n+k)0(zip[2..]$show+n)==n|code-block|syntax|javascript|3801|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.haskell.org/|1|https://tio.run/##HcHBCoMwDADQX8nBQ7vNorvt0P2IkxHUzNKYllYY@PFmsPdWrHFhViUQT4nnYl4m3t4W22ffXfC6pRkEou3MEfJwd25s6pq@INZ70Q2DgIdcguzQAAXelwIEQ@/c42/UcyLGT9V2yvkH^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="nofollow noreferrer">Haskell</a>, 53 bytes</h1>

<pre class="lang-hs prettyprint-override"><code>f n=foldr(\(k,_)a-&gt;10*a+mod n k)0(zip[2..]$show n)==n
</code></pre>
<p><a href="https://tio.run/##HcHBCoMwDADQX8nBQ7vNorvt0P2IkxHUzNKYllYY@PFmsPdWrHFhViUQT4nnYl4m3t4W22ffXfC6pRkEou3MEfJwd25s6pq@INZ70Q2DgIdcguzQAAXelwIEQ@/c42/UcyLGT9V2yvkH" rel="nofollow noreferrer" title="Haskell – Try It Online">Try it online!</a></p>


blocks|key|3077|text|Python2，61个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|3078|lambda+x:[`x%25(n%2B2)`for+n+in+range(len(`x`))][::-1]==list(`x`)|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>Python 2, 61 bytes</h2>

<pre><code>lambda x:[`x%(n+2)`for n in range(len(`x`))][::-1]==list(`x`)
</code></pre>


blocks|key|3636|text|Clojure，75字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|3637|#(=(sort+%25)(sort(map(fn[i+c](char(%2B(mod(Integer.+%25)(%2B+i+2))48)))(range)%25)))|code-block|syntax|javascript|3638|输入是一个字符串，使用map，尾随的%25最终比for[i(range(count+%25))]方法短。|unstyled|offset|length|style|CODE|entityMap^0|0|0|B|3|I|1|M|M^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@$J|R|K|S|L|M]|$J|T|K|U|L|M]|$J|V|K|W|L|M]]|9|@]|A|$]]]|N|$]]

<h2>Clojure, 75 bytes</h2>

<pre><code>#(=(sort %)(sort(map(fn[i c](char(+(mod(Integer. %)(+ i 2))48)))(range)%)))
</code></pre>

<p>Input is a string, using <code>map</code> and the trailing <code>%</code> ended up being shorter than <code>for[i(range(count %))]</code> approach.</p>


blocks|key|3837|text|MathGolf，7+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|3838|mækî)%25Ñ|code-block|syntax|javascript|3839|输入为字符串。|unstyled|3840|在网上试试。|3841|解释：|3842|m++++++++#+Map+over+each+character+of+the+(implicit)+input-string,
+æ+++++++#+using+the+following+four+characters+as+inner+code-block:
+++++++++#++(implicitly+push+the+current+character+of+the+map)
++k++++++#++Push+the+input+as+an+integer
+++î+++++#++Push+the+1-based+map-index
++++)++++#++Increase+it+by+1
+++++%25+++#++Take+the+input-integer+modulo+(1-based)+index%2B1
+++++++++#+After+the+map,+the+digits+are+implicitly+joined+together+to+a+string
++++++Ñ++#+Check+that+this+string+is+a+palindrome
+++++++++#+(after+which+the+entire+stack+joined+together+is+output+implicitly+as+result)|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/maxbergmark/mathgolf/blob/master/math_golf.txt#L332|1|https://github.com/maxbergmark/mathgolf/blob/master/code_page.py|2|https://tio.run/##y00syUjPz0n7/z/38LLsw@s0VQ9P/P9fyVCJS8nQAEgYgQhDQwOwgKERhDI2BNHGUGETAyOwUmMYw8TMyMAArNHUBKbI3AimzdDIAKbQCKQEREOsM4CQYCMMDeG0IdgZED0A^0|0|8|0|B|3|1|0|0|0|0|6|2|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]|$A|16|B|17|1|18]]|C|$]]|$1|D|3|E|5|F|7|19|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1A|8|@]|9|@]|C|$]]|$1|L|3|M|5|K|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|N|3|O|5|6|7|1F|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1G|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|T|U|V|C|$W|11]]]]

<h1><a href="https://github.com/maxbergmark/mathgolf/blob/master/math_golf.txt#L332" rel="nofollow noreferrer">MathGolf</a>, 7 <a href="https://github.com/maxbergmark/mathgolf/blob/master/code_page.py" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>mækî)%Ñ
</code></pre>
<p>Input as a string.</p>
<p><a href="https://tio.run/##y00syUjPz0n7/z/38LLsw@s0VQ9P/P9fyVCJS8nQAEgYgQhDQwOwgKERhDI2BNHGUGETAyOwUmMYw8TMyMAArNHUBKbI3AimzdDIAKbQCKQEREOsM4CQYCMMDeG0IdgZED0A" rel="nofollow noreferrer">Try it online.</a></p>
<p><strong>Explanation:</strong></p>

<pre class="lang-python prettyprint-override"><code>m        # Map over each character of the (implicit) input-string,
 æ       # using the following four characters as inner code-block:
         #  (implicitly push the current character of the map)
  k      #  Push the input as an integer
   î     #  Push the 1-based map-index
    )    #  Increase it by 1
     %   #  Take the input-integer modulo (1-based) index+1
         # After the map, the digits are implicitly joined together to a string
      Ñ  # Check that this string is a palindrome
         # (after which the entire stack joined together is output implicitly as result)
</code></pre>


blocks|key|3919|text|阿图罗，42字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|3920|$[n][1every?+reverse+digits+n'x->x=n%25<=1%2B]|code-block|syntax|javascript|3921|试试看|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://arturo-lang.io/|1|http://arturo-lang.io/playground?Ng8O9j^0|0|3|0|0|0|0|3|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://arturo-lang.io" rel="nofollow noreferrer">Arturo</a>, 42 bytes</h1>
<pre class="lang-arturo prettyprint-override"><code>$[n][1every? reverse digits n'x-&gt;x=n%&lt;=1+]
</code></pre>
<p><a href="http://arturo-lang.io/playground?Ng8O9j" rel="nofollow noreferrer">Try it</a></p>


<p>A staircase number is a positive integer <strong>x</strong> such that its <strong>n</strong>th digit (one indexed starting with the least significant digit) is equal to <strong>x % (n + 1)</strong>.  Thats a bit of a mouthful so lets look at an example.  Take <strong>7211311</strong>, if we take the modular residues of <strong>7211311</strong> on the range 2-8 we get the following:</p>

<pre><code>7211311 % 2 = 1
7211311 % 3 = 1
7211311 % 4 = 3
7211311 % 5 = 1
7211311 % 6 = 1
7211311 % 7 = 2
7211311 % 8 = 7
</code></pre>

<p>These are the digits of <strong>7211311</strong>!  Thus <strong>7211311</strong> is a staircase number.</p>

<h2>Task</h2>

<p>Write code that takes when given a positive number as input, will output two distinct values one if the number <em>is</em> a staircase number and the other if it is not.</p>

<p>This is a <a href="/questions/tagged/code-golf" class="post-tag" title="show questions tagged &#39;code-golf&#39;" rel="tag">code-golf</a> competition so your aim should be to minimize the number of bytes in your source code.</p>

<h2>Test Cases</h2>

<p>Here are the first 13 staircase numbers:</p>

<pre><code>1, 10, 20, 1101, 1121, 11311, 31101, 40210, 340210, 4620020, 5431101, 7211311, 12040210
</code></pre>


Staircase numbers

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

楼梯数是正整数x，使得它的第n位数(以最小有效数开始的索引数)等于x% (n + 1)。这是一个小口，所以让我们看看一个例子。取7211311，如果在2-8范围内取7211311的模余数，我们得到如下结果：7211311 % 2 = 17211311 % 3 = 17211311 % 4 = 37211311 % 5 = 17211311 % 6 = 17211311 % 7 = 27211311

问楼梯数
EN

任务

测试用例

回答 16

Code Golf用户

05AB1E，6字节

代码：

解释：

Code Golf用户

Python 2，54字节

Code Golf用户

Haskell，60字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问楼梯数EN

任务

测试用例

回答 16

Code Golf用户

05AB1E，6字节

代码：

解释：

Code Golf用户

Python 2，54字节

Code Golf用户

Haskell，60字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问楼梯数
EN