blocks|key|1433476|text|Python+3，55字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1433477|lambda+x:ord('%255Iāȋवુಹ෇ᑵᒙ᱕ᵣ'[x])|code-block|syntax|javascript|1433478|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##AWUAmv9weXRob24z/2Y9XP9sYW1iZGEgeDpvcmQoJwIDBQcXJTVJxIHIi@CkteCrgeCyueC3h@GRteGSmeGxleG1oydbeF0p/2ZvciB4IGluIHJhbmdlKDAsMTgpOnByaW50KGYoeCkp/w^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="nofollow noreferrer">Python 3</a>, 55 bytes</h1>

<pre class="lang-python prettyprint-override"><code>lambda x:ord('&#2;&#3;&#5;&#7;&#23;%5Iāȋवુಹ෇ᑵᒙ᱕ᵣ'[x])
</code></pre>
<p><a href="https://tio.run/##AWUAmv9weXRob24z/2Y9XP9sYW1iZGEgeDpvcmQoJwIDBQcXJTVJxIHIi@CkteCrgeCyueC3h@GRteGSmeGxleG1oydbeF0p/2ZvciB4IGluIHJhbmdlKDAsMTgpOnByaW50KGYoeCkp/w" rel="nofollow noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>


blocks|key|1421704|text|Wolfram语言(数学)，64字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1421705|Select[FromDigits/@Join@@Permutations/@Subsets@{2,3,5,7},PrimeQ]|code-block|syntax|javascript|1421706|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.wolfram.com/wolframscript/|1|https://tio.run/##y00syUjNTSzJTE78n277Pzg1JzW5JNqtKD/XJTM9s6RY38ErPzPPwSEgtSi3tASoLj8PKBZcmlScWlLsUG2kY6xjqmNeqxNQlJmbGhj7H0jnlSg4pP//DwA^0|0|D|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.wolfram.com/wolframscript/" rel="nofollow noreferrer">Wolfram Language (Mathematica)</a>, 64 bytes</h1>
<pre><code>Select[FromDigits/@Join@@Permutations/@Subsets@{2,3,5,7},PrimeQ]
</code></pre>
<p><a href="https://tio.run/##y00syUjNTSzJTE78n277Pzg1JzW5JNqtKD/XJTM9s6RY38ErPzPPwSEgtSi3tASoLj8PKBZcmlScWlLsUG2kY6xjqmNeqxNQlJmbGhj7H0jnlSg4pP//DwA" rel="nofollow noreferrer" title="Wolfram Language (Mathematica) – Try It Online">Try it online!</a></p>


blocks|key|1422186|text|杰夫特，15+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1422187|Èì_â+fjÃ¶X©j}jU|code-block|syntax|javascript|1422188|试试看|unstyled|1422189|输出序列中的第一个n条目。|style|CODE|1422190|解释：|1422191|Èì_â+fjÃ¶X©j}jU++#+input+stored+in+U
È+++++++++++}jU++#+get+first+U+numbers+where+the+following+is+true:
+ì_++++++++++++++#+convert+to+digits
+++â+++++++++++++#+++keep+unique+digits
+++++fj++++++++++#+++remove+non-prime+digits
+++++++Ã¶X+++++++#+does+this+result+in+the+same+number?
++++++++++©j+++++#+and+check+the+original+is+prime|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=yOxf4iBmasO2WKlqfWpV&input=MTg|3|INLINETEX|IMMUTABLE|teX|n^0|0|3|0|7|3|1|0|0|0|3|2|0|9|1|9|1|3|0|0^^$0|@$1|2|3|4|5|6|7|19|8|@]|9|@$A|1A|B|1B|1|1C]|$A|1D|B|1E|1|1F]]|C|$]]|$1|D|3|E|5|F|7|1G|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1H|8|@]|9|@$A|1I|B|1J|1|1K]]|C|$]]|$1|L|3|M|5|K|7|1L|8|@$A|1M|B|1N|N|O]]|9|@$A|1O|B|1P|1|1Q]]|C|$]]|$1|P|3|Q|5|K|7|1R|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1S|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]]|14|$5|15|W|16|C|$17|18]]]]

<h1><a href="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 15 <a href="https://en.wikipedia.org/wiki/ISO/IEC_8859-1" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>Èì_â fjÃ¶X©j}jU
</code></pre>
<p><a href="https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&amp;code=yOxf4iBmasO2WKlqfWpV&amp;input=MTg" rel="nofollow noreferrer">Try it</a></p>
<p>Outputs the first <span class="math-container">\$n\$</span> entries in the sequence.</p>
<p>Explanation:</p>
<pre class="lang-python prettyprint-override"><code>Èì_â fjÃ¶X©j}jU  # input stored in U
È           }jU  # get first U numbers where the following is true:
 ì_              # convert to digits
   â             #   keep unique digits
     fj          #   remove non-prime digits
       Ã¶X       # does this result in the same number?
          ©j     # and check the original is prime
</code></pre>


blocks|key|1433337|text|Bash+%2B+Bsd运动会+%2B+核心用途，40|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1433338|primes+2+7777%7Cegrep+-v+'[%5E2357]%7C(.).*\1'|code-block|syntax|javascript|1433339|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/bash/|1|https://wiki.linuxquestions.org/wiki/BSD_games|2|https://www.gnu.org/software/coreutils/|3|https://tio.run/##S0oszvj/v6AoMze1WMFIwRwIalLTi1ILFHTLFNSj44yMTc1jazT0NPW0YgzV//8HAA^0|0|4|0|7|6|1|G|4|2|0|0|0|6|3^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]|$A|12|B|13|1|14]|$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|$]]]|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]]|W|$5|N|O|P|C|$Q|X]]]]

<h1><a href="https://www.gnu.org/software/bash/" rel="nofollow noreferrer">Bash</a> + <a href="https://wiki.linuxquestions.org/wiki/BSD_games" rel="nofollow noreferrer">bsdgames</a> + <a href="https://www.gnu.org/software/coreutils/" rel="nofollow noreferrer">coreutils</a>, 40</h1>

<pre class="lang-bash prettyprint-override"><code>primes 2 7777|egrep -v '[^2357]|(.).*\1'
</code></pre>
<p><a href="https://tio.run/##S0oszvj/v6AoMze1WMFIwRwIalLTi1ILFHTLFNSj44yMTc1jazT0NPW0YgzV//8HAA" rel="nofollow noreferrer" title="Bash – Try It Online">Try it online!</a></p>


blocks|key|1422674|text|脑盘，213个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1422675|-[----->%2B>%2B>%2B<<<]>-.---.>.<.>%2B%2B.<.>%2B%2B.<.>>-.%2B.<<.>>.<.<.>--.>.<<.>%2B%2B.>.<<.>>-.<--.%2B%2B.<.>--.>.%2B.<<.>>-.%2B.<.%2B%2B.<.>>-.<.--.>%2B.<<.>>.-.<.%2B%2B.<.>>%2B.<--.>-.<%2B%2B.<.>--.>.%2B.<%2B%2B.<.>--.>-.<%2B%2B.>%2B.<<.>.>-.<--.>%2B.<<.>%2B%2B.--.>-.%2B.|code-block|syntax|javascript|1422676|在网上试试！|unstyled|1422677|设置3个单元格，ASCII+255/5=51+(字符3)，然后生成输出搜索和peck样式(必要时增加和减少)。|style|CODE|1422678|单元格1用于打印2，然后打印分隔符/。|1422679|单元格2用于打印3+5+7以及其后的数字5+&+7。|1422680|单元格3用于打印数字2和3。|1422681|可能是第四个单元格允许将单独的单元格用于5和7，从而导致代码更短。我以后可能会调查这个。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/TryItOnline/brainfuck|1|https://tio.run/##VY1RCoBACEQPJHoC8SLRRwVBBH0End/G1W1pF1Zn3uiu93Jc@7Od7jxxHKO4qjobC7SYqBjReOGjRgOFkpnE2SChcDPeMHU/rG@NSsC@jAeiNh@J/46hEtWs1IclATJC4v4C^0|0|2|0|0|0|0|6|1|0|Q|1|0|8|1|H|1|0|8|1|A|1|C|1|K|1|O|1|0|A|1|C|1|0|K|1|M|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|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|L|3|M|5|K|7|1F|8|@$A|1G|B|1H|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1I|8|@$A|1J|B|1K|N|O]|$A|1L|B|1M|N|O]]|9|@]|C|$]]|$1|R|3|S|5|K|7|1N|8|@$A|1O|B|1P|N|O]|$A|1Q|B|1R|N|O]|$A|1S|B|1T|N|O]|$A|1U|B|1V|N|O]|$A|1W|B|1X|N|O]]|9|@]|C|$]]|$1|T|3|U|5|K|7|1Y|8|@$A|1Z|B|20|N|O]|$A|21|B|22|N|O]]|9|@]|C|$]]|$1|V|3|W|5|K|7|23|8|@$A|24|B|25|N|O]|$A|26|B|27|N|O]]|9|@]|C|$]]]|X|$Y|$5|Z|10|11|C|$12|13]]|14|$5|Z|10|11|C|$12|15]]]]

<h1><a href="https://github.com/TryItOnline/brainfuck" rel="nofollow noreferrer">brainfuck</a>, 213 bytes</h1>
<pre><code>-[-----&gt;+&gt;+&gt;+&lt;&lt;&lt;]&gt;-.---.&gt;.&lt;.&gt;++.&lt;.&gt;++.&lt;.&gt;&gt;-.+.&lt;&lt;.&gt;&gt;.&lt;.&lt;.&gt;--.&gt;.&lt;&lt;.&gt;++.&gt;.&lt;&lt;.&gt;&gt;-.&lt;--.++.&lt;.&gt;--.&gt;.+.&lt;&lt;.&gt;&gt;-.+.&lt;.++.&lt;.&gt;&gt;-.&lt;.--.&gt;+.&lt;&lt;.&gt;&gt;.-.&lt;.++.&lt;.&gt;&gt;+.&lt;--.&gt;-.&lt;++.&lt;.&gt;--.&gt;.+.&lt;++.&lt;.&gt;--.&gt;-.&lt;++.&gt;+.&lt;&lt;.&gt;.&gt;-.&lt;--.&gt;+.&lt;&lt;.&gt;++.--.&gt;-.+.
</code></pre>
<p><a href="https://tio.run/##VY1RCoBACEQPJHoC8SLRRwVBBH0End/G1W1pF1Zn3uiu93Jc@7Od7jxxHKO4qjobC7SYqBjReOGjRgOFkpnE2SChcDPeMHU/rG@NSsC@jAeiNh@J/46hEtWs1IclATJC4v4C" rel="nofollow noreferrer" title="brainfuck – Try It Online">Try it online!</a></p>
<p>Sets up 3 cells with ASCII 255/5=51 (character <code>3</code>) then produces the output hunt and peck style (with increments and decrements as necessary).</p>
<p>Cell 1 is used to print <code>2</code> and thereafter the separator <code>/</code></p>
<p>Cell 2 is used to print <code>3</code> <code>5</code> <code>7</code> and thereafter the digits <code>5</code> &amp; <code>7</code></p>
<p>Cell 3 is used to print the digits <code>2</code> and <code>3</code></p>
<p>It's possible that a 4th cell may lead to shorter code by allowing separate cells to be used for <code>5</code> and <code>7</code>. I may investigate this later.</p>


blocks|key|1433013|text|JavaScript+(V8)，66字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1433014|打印序列并永远循环。|unstyled|1433015|{for(n=x=2;;)n%25--x%7C%7Cx>1%7C/(.).*\1%7C[%5E2357]/.test(x=n%2B%2B)%7C%7Cprint(n-1)}|code-block|syntax|javascript|1433016|在网上试试！|1433017|JavaScript+(V8)，71字节|1433018|打印序列并停止。|1433019|{for(n=x=2;n<8e3;)n%25--x%7C%7Cx>1%7C/(.).*\1%7C[%5E2357]/.test(x=n%2B%2B)%7C%7Cprint(n-1)}|1433020|entityMap|0|LINK|mutability|MUTABLE|url|https://v8.dev/|1|https://tio.run/##y0osSyxOLsosKNEts/j/vzotv0gjz7bC1sjaWjNPVVe3oqamws6wRl9DT1NPK8awJjrOyNjUPFZfryS1uESjwjZPW1uzpqagKDOvRCNP11Cz9v9/AA|2|3|https://tio.run/##BcFbCoAgEADA0wRaqKhEgtlFekBEQX1soSJC29lt5lrTGjZ/PpElU8p73J6Ay05Z6M2uLYWKsYyYB4mCcMrrSeK4KN12s@BxD5FkB01DER9/QiTAJP1K@QE^0|0|F|0|0|0|0|0|6|1|0|0|F|2|0|0|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|$]]|$1|G|3|H|5|I|7|1B|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]|$1|N|3|O|5|6|7|1G|8|@]|9|@$A|1H|B|1I|1|1J]]|C|$]]|$1|P|3|Q|5|F|7|1K|8|@]|9|@]|C|$]]|$1|R|3|S|5|I|7|1L|8|@]|9|@]|C|$J|K]]|$1|T|3|M|5|F|7|1M|8|@]|9|@$A|1N|B|1O|1|1P]]|C|$]]]|U|$V|$5|W|X|Y|C|$Z|10]]|11|$5|W|X|Y|C|$Z|12]]|13|$5|W|X|Y|C|$Z|10]]|14|$5|W|X|Y|C|$Z|15]]]]

<h1><a href="https://v8.dev/" rel="nofollow noreferrer">JavaScript (V8)</a>, 66 bytes</h1>
<p>Prints the sequence and keeps looping forever.</p>

<pre class="lang-javascript prettyprint-override"><code>{for(n=x=2;;)n%--x||x&gt;1|/(.).*\1|[^2357]/.test(x=n++)||print(n-1)}
</code></pre>
<p><a href="https://tio.run/##y0osSyxOLsosKNEts/j/vzotv0gjz7bC1sjaWjNPVVe3oqamws6wRl9DT1NPK8awJjrOyNjUPFZfryS1uESjwjZPW1uzpqagKDOvRCNP11Cz9v9/AA" rel="nofollow noreferrer" title="JavaScript (V8) – Try It Online">Try it online!</a></p>
<h1><a href="https://v8.dev/" rel="nofollow noreferrer">JavaScript (V8)</a>, 71 bytes</h1>
<p>Prints the sequence and stops.</p>

<pre class="lang-javascript prettyprint-override"><code>{for(n=x=2;n&lt;8e3;)n%--x||x&gt;1|/(.).*\1|[^2357]/.test(x=n++)||print(n-1)}
</code></pre>
<p><a href="https://tio.run/##BcFbCoAgEADA0wRaqKhEgtlFekBEQX1soSJC29lt5lrTGjZ/PpElU8p73J6Ay05Z6M2uLYWKsYyYB4mCcMrrSeK4KN12s@BxD5FkB01DER9/QiTAJP1K@QE" rel="nofollow noreferrer" title="JavaScript (V8) – Try It Online">Try it online!</a></p>


blocks|key|1433842|text|05AB1E，10+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1433843|₄ÅpʒÐÙSpÏQ|code-block|syntax|javascript|1433844|输出整个序列。|unstyled|1433845|在网上试试。|1433846|我认为它与它自己的答案有足够的不同。一定要投@TheThonnu10字节05AB1E答案的票！|1433847|解释：|1433848|₄+++++++++++#+Push+1000
+Åp+++++++++#+Pop+and+push+a+list+of+the+first+1000+prime+numbers+(up+to+7919)
+++ʒ++++++++#+Filter+it+by:
++++Ð+++++++#++Triplicate+the+prime+number
+++++Ù++++++#++Pop+one+copy,+and+uniquify+its+digits
++++++Sp++++#++Check+for+each+unique+digit+whether+it's+a+prime+number
++++++++Ï+++#++Pop+another+copy,+and+only+keep+its+digits+at+the+truthy+indices
+++++++++Q++#++Check+if+the+two+integers+are+still+the+same
++++++++++++#+(after+which+the+filtered+list+is+output+implicitly)|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//UVPL4daCU5MOTzg8M7jgcH/g//8A|3|https://codegolf.stackexchange.com/a/258303/52210^0|0|6|0|A|3|1|0|0|0|0|6|2|0|M|M|3|0|0^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@$A|17|B|18|1|19]|$A|1A|B|1B|1|1C]]|C|$]]|$1|D|3|E|5|F|7|1D|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1E|8|@]|9|@]|C|$]]|$1|L|3|M|5|K|7|1F|8|@]|9|@$A|1G|B|1H|1|1I]]|C|$]]|$1|N|3|O|5|K|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|P|3|Q|5|6|7|1N|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1O|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]]|14|$5|V|W|X|C|$Y|15]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E/wiki/Commands" rel="nofollow noreferrer">05AB1E</a>, 10 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>₄ÅpʒÐÙSpÏQ
</code></pre>
<p>Outputs the entire sequence.</p>
<p><a href="https://tio.run/##yy9OTMpM/f//UVPL4daCU5MOTzg8M7jgcH/g//8A" rel="nofollow noreferrer">Try it online.</a></p>
<p>Alternative 10-byter that I deemed different enough for its own answer. Make sure to upvote <a href="https://codegolf.stackexchange.com/a/258303/52210"><em>@TheThonnu</em>'s 10-bytes 05AB1E answer</a> as well!</p>
<p><strong>Explanation:</strong></p>

<pre class="lang-python prettyprint-override"><code>₄           # Push 1000
 Åp         # Pop and push a list of the first 1000 prime numbers (up to 7919)
   ʒ        # Filter it by:
    Ð       #  Triplicate the prime number
     Ù      #  Pop one copy, and uniquify its digits
      Sp    #  Check for each unique digit whether it's a prime number
        Ï   #  Pop another copy, and only keep its digits at the truthy indices
         Q  #  Check if the two integers are still the same
            # (after which the filtered list is output implicitly)
</code></pre>


blocks|key|1433928|text|斯塔克斯，15+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1433929|¢\W░i*δÿ╛ñê╠≤▬J|code-block|syntax|javascript|1433930|运行并调试它|unstyled|1433931|这是打包的Stax，当解压缩时它表示以下18个字节|1433932|VIfEccu=%5E%2B_%2B{%7Cpm%7CA|1433933|1433934|VIf++++++++++++++++#+filter+the+following+over+infinity
+++E+cu=+++++++++++#+Are+all+the+digits+in+the+number+unique?
++++c+++%5E%2B+++++++++#+Increment+this+and+add+it+to+the+list+(yielding+prime+value+2+for+truthy)
++++++++++_%2B+++++++#+add+the+current+value+to+the+list
++++++++++++++++%7CA+#+are+all+of+the+values+in+this+list
++++++++++++{%7Cpm+++#+prime?|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/tomtheisen/stax|1|https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax|2|https://staxlang.xyz/#p=9b5c57b0692aeb98bea488ccf3164a&i=|3|https://staxlang.xyz/#c=VIfEccu%253D%255E%252B_%252B%257B%257Cpm%257CA&i=^0|0|4|0|8|3|1|0|0|0|6|2|0|0|0|0|6|3|0^^$0|@$1|2|3|4|5|6|7|15|8|@]|9|@$A|16|B|17|1|18]|$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|K|7|1H|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1I|8|@]|9|@]|C|$G|H]]|$1|P|3|J|5|K|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|Q|3|R|5|F|7|1N|8|@]|9|@]|C|$G|H]]]|S|$T|$5|U|V|W|C|$X|Y]]|Z|$5|U|V|W|C|$X|10]]|11|$5|U|V|W|C|$X|12]]|13|$5|U|V|W|C|$X|14]]]]

<h1><a href="https://github.com/tomtheisen/stax" rel="nofollow noreferrer">Stax</a>, 15 <a href="https://github.com/tomtheisen/stax/blob/master/docs/packed.md#packed-stax" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>¢\W░i*δÿ╛ñê╠≤▬J
</code></pre>
<p><a href="https://staxlang.xyz/#p=9b5c57b0692aeb98bea488ccf3164a&amp;i=" rel="nofollow noreferrer">Run and debug it</a></p>
<p>This is Packed Stax, which when unpacked represents the following 18 bytes</p>
<pre><code>VIfEccu=^+_+{|pm|A
</code></pre>
<p><a href="https://staxlang.xyz/#c=VIfEccu%3D%5E%2B_%2B%7B%7Cpm%7CA&amp;i=" rel="nofollow noreferrer">Run and debug it</a></p>
<pre><code>VIf                # filter the following over infinity
   E cu=           # Are all the digits in the number unique?
    c   ^+         # Increment this and add it to the list (yielding prime value 2 for truthy)
          _+       # add the current value to the list
                |A # are all of the values in this list
            {|pm   # prime?
</code></pre>


blocks|key|1422021|text|木炭，29字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1422022|ＩΦ×φχ∧⬤”)∨∧i#”‹№ＩιＩμＩλ⬤…²ι﹪ιλ|code-block|syntax|javascript|1422023|在网上试试！链接是详细的代码版本。解释：|unstyled|1422024|+++φ++++++++++++++++++++++++Predefined+variable+`1000`
++×+++++++++++++++++++++++++Multiplied+by
++++χ+++++++++++++++++++++++Predefined+variable+`10`
+Φ++++++++++++++++++++++++++Filtered+where
+++++++”...”++++++++++++++++Compressed+string+`1122121211`
++++++⬤+++++++++++++++++++++All+characters+satisfy
+++++++++++++№++++++++++++++Count+of
+++++++++++++++++μ++++++++++Inner+index
++++++++++++++++Ｉ+++++++++++Cast+to+string
+++++++++++++++ι++++++++++++In+outer+value
++++++++++++++Ｉ+++++++++++++Cast+to+string
++++++++++++‹+++++++++++++++Is+less+than
+++++++++++++++++++λ++++++++Current+character
++++++++++++++++++Ｉ+++++++++Cast+to+integer
+++++∧++++++++++++++++++++++Logical+And
+++++++++++++++++++++…++++++Range+from
++++++++++++++++++++++²+++++Literal+integer+`2`
+++++++++++++++++++++++ι++++To+current+value
++++++++++++++++++++⬤+++++++All+values+satisfy
+++++++++++++++++++++++++ι++Outer+value
++++++++++++++++++++++++﹪+++Modulo+(i.e.+is+not+divisible+by)
++++++++++++++++++++++++++λ+Inner+value
Ｉ+++++++++++++++++++++++++++Cast+to+string
++++++++++++++++++++++++++++Implicitly+print|1422025|一个效率较低的版本的34个字节：|1422026|⊞υωＦυＦ⁺ι⁻⪪2357¹⪪ι¹⊞υκＩΦＩυ∧ι⬤…²ι﹪ιλ|1422027|1422028|⊞υω|1422029|从空字符串开始。|1422030|Ｆυ|1422031|在数字字符串上循环。|1422032|Ｆ⁺ι⁻⪪2357¹⪪ι¹|1422033|追加尚未出现的每一个素数。|1422034|⊞υκ|1422035|将新字符串保存到具有不同素数的数字列表中。|1422036|ＩΦＩυ∧ι⬤…²ι﹪ιλ|1422037|只输出那些表示素数的字符串。|1422038|通过在ATO上使用较新版本的木炭，可以获得33个字节：|1422039|⊞υωＦ⁴«≔ΣＥ2357⁺κΦυ¬№μκυＩΦＩυ⬤…²κ﹪κμ|1422040|1422041|1422042|1422043|Ｆ⁴«|1422044|循环4时间。|style|CODE|1422045|≔ΣＥ2357⁺κΦυ¬№μκυ|1422046|对于每个素数，将其前缀为所有尚未包含该数字的前几个字符串，并将所有结果列表连接起来。|1422047|ＩΦＩυ⬤…²κ﹪κμ|1422048|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/somebody1234/Charcoal|1|https://tio.run/##NYsxCsMwDEWvIjLJ4ILltVMIdGohlF7AJKY1KDbYTq@vRoX8v7zhveUT6lICi8w15Y5TaB1viXus@EpbbEjOOQvkjIUxrzgy40DkPelpsHCPreFU9rNOh/mHzZzERlHTZ8jviN6CWo@y7lwwWVDh2FVELl/@AQ|2|https://tio.run/##NYzBCsIwEETvfsXS0wbiwYp46KkI3gpBvyC01S4uSUmy@vkxsTiXnZ1h3rjYMHrLORuJC4qGj@p2Dx8ARcHvGpaIpGEgV8x9ZUrYtMfTudFwUBq2hOpTBH/Oq3BMIJfwYmPCK3Gaw@alrHo31U3PjDfrnjO2Gqjkg5@Efa244lSXc96/@Qs|3|https://ato.pxeger.com/run?1=m70iOSOxKDk_MWfBgqWlJWm6FjdnBZQWZ2iU6iiUa1pzpeUXKWiYaCpUc3E6FhdnpudpBJfmavgmFmgoGRmbmivpKATklBZrZOsouGXmlKQWgfT55ZdoOOeX5pVo5OooZGuCgY5CKdA0zoCiTKCwc2JxiQZUPZhdCpR3zMnRCErMS0_VMALp0lHwzU8pzckHGZ0LNsKaq3ZJcVJyMdSdy6OVdMtylGKhXAA^0|0|2|0|0|0|0|6|1|0|0|0|0|0|6|2|0|0|0|0|0|0|0|0|0|0|0|0|0|0|6|3|0|0|0|0|2|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|29|8|@]|9|@$A|2A|B|2B|1|2C]]|C|$]]|$1|D|3|E|5|F|7|2D|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|2E|8|@]|9|@$A|2F|B|2G|1|2H]]|C|$]]|$1|L|3|M|5|F|7|2I|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|2J|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|2K|8|@]|9|@]|C|$G|H]]|$1|R|3|J|5|K|7|2L|8|@]|9|@$A|2M|B|2N|1|2O]]|C|$]]|$1|S|3|T|5|F|7|2P|8|@]|9|@]|C|$G|H]]|$1|U|3|V|5|K|7|2Q|8|@]|9|@]|C|$]]|$1|W|3|X|5|F|7|2R|8|@]|9|@]|C|$G|H]]|$1|Y|3|Z|5|K|7|2S|8|@]|9|@]|C|$]]|$1|10|3|11|5|F|7|2T|8|@]|9|@]|C|$G|H]]|$1|12|3|13|5|K|7|2U|8|@]|9|@]|C|$]]|$1|14|3|15|5|F|7|2V|8|@]|9|@]|C|$G|H]]|$1|16|3|17|5|K|7|2W|8|@]|9|@]|C|$]]|$1|18|3|19|5|F|7|2X|8|@]|9|@]|C|$G|H]]|$1|1A|3|1B|5|K|7|2Y|8|@]|9|@]|C|$]]|$1|1C|3|1D|5|K|7|2Z|8|@]|9|@]|C|$]]|$1|1E|3|1F|5|F|7|30|8|@]|9|@]|C|$G|H]]|$1|1G|3|J|5|K|7|31|8|@]|9|@$A|32|B|33|1|34]]|C|$]]|$1|1H|3|T|5|F|7|35|8|@]|9|@]|C|$G|H]]|$1|1I|3|V|5|K|7|36|8|@]|9|@]|C|$]]|$1|1J|3|1K|5|F|7|37|8|@]|9|@]|C|$G|H]]|$1|1L|3|1M|5|K|7|38|8|@$A|39|B|3A|1N|1O]]|9|@]|C|$]]|$1|1P|3|1Q|5|F|7|3B|8|@]|9|@]|C|$G|H]]|$1|1R|3|1S|5|K|7|3C|8|@]|9|@]|C|$]]|$1|1T|3|1U|5|F|7|3D|8|@]|9|@]|C|$G|H]]|$1|1V|3|1B|5|K|7|3E|8|@]|9|@]|C|$]]]|1W|$1X|$5|1Y|1Z|20|C|$21|22]]|23|$5|1Y|1Z|20|C|$21|24]]|25|$5|1Y|1Z|20|C|$21|26]]|27|$5|1Y|1Z|20|C|$21|28]]]]

<h1><a href="https://github.com/somebody1234/Charcoal" rel="nofollow noreferrer">Charcoal</a>, 29 bytes</h1>
<pre><code>ＩΦ×φχ∧⬤”)∨∧i#”‹№ＩιＩμＩλ⬤…²ι﹪ιλ
</code></pre>
<p><a href="https://tio.run/##NYsxCsMwDEWvIjLJ4ILltVMIdGohlF7AJKY1KDbYTq@vRoX8v7zhveUT6lICi8w15Y5TaB1viXus@EpbbEjOOQvkjIUxrzgy40DkPelpsHCPreFU9rNOh/mHzZzERlHTZ8jviN6CWo@y7lwwWVDh2FVELl/@AQ" rel="nofollow noreferrer" title="Charcoal – Try It Online">Try it online!</a> Link is to verbose version of code. Explanation:</p>
<pre><code>   φ                        Predefined variable `1000`
  ×                         Multiplied by
    χ                       Predefined variable `10`
 Φ                          Filtered where
       ”...”                Compressed string `1122121211`
      ⬤                     All characters satisfy
             №              Count of
                 μ          Inner index
                Ｉ           Cast to string
               ι            In outer value
              Ｉ             Cast to string
            ‹               Is less than
                   λ        Current character
                  Ｉ         Cast to integer
     ∧                      Logical And
                     …      Range from
                      ²     Literal integer `2`
                       ι    To current value
                    ⬤       All values satisfy
                         ι  Outer value
                        ﹪   Modulo (i.e. is not divisible by)
                          λ Inner value
Ｉ                           Cast to string
                            Implicitly print
</code></pre>
<p>34 bytes for a less inefficient version:</p>
<pre><code>⊞υωＦυＦ⁺ι⁻⪪2357¹⪪ι¹⊞υκＩΦＩυ∧ι⬤…²ι﹪ιλ
</code></pre>
<p><a href="https://tio.run/##NYzBCsIwEETvfsXS0wbiwYp46KkI3gpBvyC01S4uSUmy@vkxsTiXnZ1h3rjYMHrLORuJC4qGj@p2Dx8ARcHvGpaIpGEgV8x9ZUrYtMfTudFwUBq2hOpTBH/Oq3BMIJfwYmPCK3Gaw@alrHo31U3PjDfrnjO2Gqjkg5@Efa244lSXc96/@Qs" rel="nofollow noreferrer" title="Charcoal – Try It Online">Try it online!</a> Link is to verbose version of code. Explanation:</p>
<pre><code>⊞υω
</code></pre>
<p>Start with the empty string.</p>
<pre><code>Ｆυ
</code></pre>
<p>Loop over the strings of digits.</p>
<pre><code>Ｆ⁺ι⁻⪪2357¹⪪ι¹
</code></pre>
<p>Append each prime digit that isn't yet present.</p>
<pre><code>⊞υκ
</code></pre>
<p>Save the new strings to the list of numbers with distinct prime digits.</p>
<pre><code>ＩΦＩυ∧ι⬤…²ι﹪ιλ
</code></pre>
<p>Output only those strings that represent primes.</p>
<p>33 bytes by using the newer version of Charcoal on ATO:</p>
<pre><code>⊞υωＦ⁴«≔ΣＥ2357⁺κΦυ¬№μκυＩΦＩυ⬤…²κ﹪κμ
</code></pre>
<p><a href="https://ato.pxeger.com/run?1=m70iOSOxKDk_MWfBgqWlJWm6FjdnBZQWZ2iU6iiUa1pzpeUXKWiYaCpUc3E6FhdnpudpBJfmavgmFmgoGRmbmivpKATklBZrZOsouGXmlKQWgfT55ZdoOOeX5pVo5OooZGuCgY5CKdA0zoCiTKCwc2JxiQZUPZhdCpR3zMnRCErMS0_VMALp0lHwzU8pzckHGZ0LNsKaq3ZJcVJyMdSdy6OVdMtylGKhXAA" rel="nofollow noreferrer" title="Charcoal – Attempt This Online">Attempt This Online!</a> Link is to verbose version of code. Explanation:</p>
<pre><code>⊞υω
</code></pre>
<p>Start with the empty string.</p>
<pre><code>Ｆ⁴«
</code></pre>
<p>Loop <code>4</code> times.</p>
<pre><code>≔ΣＥ2357⁺κΦυ¬№μκυ
</code></pre>
<p>For each prime digit, prefix it to all previous strings that do not already contain that digit, and concatenate all of the resulting lists.</p>
<pre><code>ＩΦＩυ⬤…²κ﹪κμ
</code></pre>
<p>Output only those strings that represent primes.</p>


blocks|key|1433428|text|Excel，145个字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1433429|=LET(
++++a,SEQUENCE(6%5E5),
++++b,FILTER(a,MMULT(N(LEN(a)-LEN(SUBSTITUTE(a,{2,3,5,7},""))=1),{1;1;1;1})=LEN(a)),
++++FILTER(b,MMULT(N(MOD(b,TOROW(a))=0),a%5E0)=2)
)|code-block|syntax|javascript|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|H|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|I|8|@]|9|@]|A|$E|F]]]|G|$]]

<h1>Excel, 145 bytes</h1>
<pre><code>=LET(
    a,SEQUENCE(6^5),
    b,FILTER(a,MMULT(N(LEN(a)-LEN(SUBSTITUTE(a,{2,3,5,7},&quot;&quot;))=1),{1;1;1;1})=LEN(a)),
    FILTER(b,MMULT(N(MOD(b,TOROW(a))=0),a^0)=2)
)
</code></pre>


blocks|key|1434032|text|SageMath，288个字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1434033|金色版，在线运行！|unstyled|1434034|from+itertools+import+permutations,+chain,+combinations;+from+sage.all+import+is_prime;+print([int(''.join(map(str,+p)))+for+p+in+chain.from_iterable(permutations(s)+for+s+in+chain.from_iterable(combinations({2,+3,+5,+7},+r)+for+r+in+range(1,+5)))+if+is_prime(int(''.join(map(str,+p))))])|code-block|syntax|javascript|1434035|Ungolfed版本，在线运行！|1434036|from+itertools+import+permutations,+chain,+combinations
from+sage.all+import+is_prime

digits+=+{2,+3,+5,+7}
subsets+=+chain.from_iterable(combinations(digits,+r)+for+r+in+range(1,+len(digits)+%2B+1))
perms+=+chain.from_iterable(permutations(s)+for+s+in+subsets)
nums+=+(int(''.join(map(str,+p)))+for+p+in+perms)
primes+=+[n+for+n+in+nums+if+is_prime(n)]

print(primes)|entityMap|0|LINK|mutability|MUTABLE|url|https://www.sagemath.org/|1|https://sagecell.sagemath.org/?z=eJx1jsEKAjEMRH8lt02hLKiIh_0UkaUr7Rppm5LWk_jvthRlL3vJQDIzeU44ABUrhdlnoJBYCiQr4VVMIY5Zw_1hKFbhsFDsywlcC2az2tF4_8tRnpNQsBNUiQWvbQzD-GSKGEzCXERDUkqBY4EEFHv72OrmxmEWb3H7H3M35z3zlgvfRw0nDWcNl48G6VFpUTFxtXiot_ae3B8WdyHVTX0Bod1jNw==&lang=sage&interacts=eJyLjgUAARUAuQ==|2|https://sagecell.sagemath.org/?z=eJx1kM1KBDEMgO-FvkNu22IZWEU8-SQiS0c7Y2SalqRzEt_dSbvKXjyVJvm-_CxcMmBL3ErZBDDXwg1q4ry32LCQBHj7iEjHU_KMNILWLApKXNMUt-2XQ7lUxpysseYdV2wCz_B1H-AhwGOAp29rZJ8l9XjXTuq56ABx3pK77eGGIQB7WAoDAxJwpDW5c4At0bXAwx2cvbdGp_5PfLuRkyEUFV7nOXDaO-2Qmjudps-C5HKsThoHqN4PqCrUO2lHXVahF-pJ0mT34PJ3DEf-VQ9yfA7zQPwPeBN-xg==&lang=sage&interacts=eJyLjgUAARUAuQ==^0|0|8|0|0|4|5|1|0|0|B|5|2|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|@$A|15|B|16|1|17]]|C|$]]|$1|G|3|H|5|I|7|18|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|N|3|O|5|I|7|1D|8|@]|9|@]|C|$J|K]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]|Y|$5|R|S|T|C|$U|Z]]]]

<h1><a href="https://www.sagemath.org/" rel="nofollow noreferrer">SageMath</a>, 288 bytes</h1>
<p>Golfed version, <a href="https://sagecell.sagemath.org/?z=eJx1jsEKAjEMRH8lt02hLKiIh_0UkaUr7Rppm5LWk_jvthRlL3vJQDIzeU44ABUrhdlnoJBYCiQr4VVMIY5Zw_1hKFbhsFDsywlcC2az2tF4_8tRnpNQsBNUiQWvbQzD-GSKGEzCXERDUkqBY4EEFHv72OrmxmEWb3H7H3M35z3zlgvfRw0nDWcNl48G6VFpUTFxtXiot_ae3B8WdyHVTX0Bod1jNw==&amp;lang=sage&amp;interacts=eJyLjgUAARUAuQ==" rel="nofollow noreferrer">run it online!</a></p>
<pre><code>from itertools import permutations, chain, combinations; from sage.all import is_prime; print([int(''.join(map(str, p))) for p in chain.from_iterable(permutations(s) for s in chain.from_iterable(combinations({2, 3, 5, 7}, r) for r in range(1, 5))) if is_prime(int(''.join(map(str, p))))])
</code></pre>
<p>Ungolfed version, <a href="https://sagecell.sagemath.org/?z=eJx1kM1KBDEMgO-FvkNu22IZWEU8-SQiS0c7Y2SalqRzEt_dSbvKXjyVJvm-_CxcMmBL3ErZBDDXwg1q4ry32LCQBHj7iEjHU_KMNILWLApKXNMUt-2XQ7lUxpysseYdV2wCz_B1H-AhwGOAp29rZJ8l9XjXTuq56ABx3pK77eGGIQB7WAoDAxJwpDW5c4At0bXAwx2cvbdGp_5PfLuRkyEUFV7nOXDaO-2Qmjudps-C5HKsThoHqN4PqCrUO2lHXVahF-pJ0mT34PJ3DEf-VQ9yfA7zQPwPeBN-xg==&amp;lang=sage&amp;interacts=eJyLjgUAARUAuQ==" rel="nofollow noreferrer">run it online!</a></p>
<pre><code>from itertools import permutations, chain, combinations
from sage.all import is_prime

digits = {2, 3, 5, 7}
subsets = chain.from_iterable(combinations(digits, r) for r in range(1, len(digits) + 1))
perms = chain.from_iterable(permutations(s) for s in subsets)
nums = (int(''.join(map(str, p))) for p in perms)
primes = [n for n in nums if is_prime(n)]

print(primes)

</code></pre>


<p>There are 18 primes with distinct prime digits (<a href="https://oeis.org/A124674" rel="noreferrer">A124674</a>). Namely, they are:</p>
<p><span class="math-container">\$2, 3, 5, 7, 23, 37, 53, 73, 257, 523, 2357, 2753, 3257, 3527, 5237, 5273, 7253, 7523\$</span></p>
<p>Your task is to output this sequence.</p>
<h1>Rules</h1>
<ul>
<li><p><a href="/questions/tagged/sequence" class="post-tag" title="show questions tagged &#39;sequence&#39;" aria-label="show questions tagged &#39;sequence&#39;" rel="tag" aria-labelledby="tag-sequence-tooltip-container">sequence</a> <a href="https://codegolf.stackexchange.com/tags/sequence/info">rules</a> apply. This means valid solutions may use any of the following formats:</p>
<ul>
<li>Given some index <span class="math-container">\$n\$</span> it can return the <span class="math-container">\$n\$</span>-th entry of the list.</li>
<li>Given some index <span class="math-container">\$n\$</span> it can return all entries up to the <span class="math-container">\$n\$</span>th one in the sequence.</li>
<li>Without taking any index, it can output <em>all</em> entries by e.g. ...
<ul>
<li>...printing them one by one (potentially infinitely) or...</li>
<li>...returning a list (lazy if the sequence is infinite) or...</li>
<li>...returning a generator that represents the whole sequence.</li>
<li>Note: the solution may print/generate infinitely, but once the entire sequence is output, subsequent outputs must be blank.</li>
</ul>
</li>
</ul>
</li>
<li><p>If taken, you may assume the input <span class="math-container">\$n\$</span> is always valid. (with 0-based indexing, <span class="math-container">\$ 0 \le n \le 17 \$</span>; with 1-based indexing, <span class="math-container">\$ 1 \le n \le 18 \$</span>)</p>
</li>
<li><p>This is <a href="/questions/tagged/code-golf" class="post-tag" title="show questions tagged &#39;code-golf&#39;" aria-label="show questions tagged &#39;code-golf&#39;" rel="tag" aria-labelledby="tag-code-golf-tooltip-container">code-golf</a>; fewest bytes wins.</p>
</li>
<li><p>Standard loopholes apply.</p>
</li>
</ul>


Primes with Distinct Prime Digits

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

有18个素数与不同的素数(A124674)。即，它们是：2, 3, 5, 7, 23, 37, 53, 73, 257, 523, 2357, 2753, 3257, 3527, 5237, 5273, 7253, 7523您的任务是输出此序列。规则序列 规则适用。这意味着有效的解决方案可以使用以下任何格式：给定一些索引n，它可以返回列表的n-th条目。给定一些索引n，它可以将所有条目返回到序列中

问具有不同素数的素数
EN

规则

回答 11

Code Golf用户

Python 3，55字节

Code Golf用户

Wolfram语言(数学)，64字节

Code Golf用户

杰夫特，15 字节数

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问具有不同素数的素数EN

规则

回答 11

Code Golf用户

Python 3，55字节

Code Golf用户

Wolfram语言(数学)，64字节

Code Golf用户

杰夫特，15 字节数

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问具有不同素数的素数
EN