blocks|key|1951661|text|05AB1E，5+字节数|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1951662|ÑnOÅ²|code-block|syntax|javascript|1951663|在网上试试！|unstyled|1951664|怎么做？|1951665|ÑnOÅ²
Ñ+++++-+divisors
+n++++-+square
++O+++-+sum
+++Å²+-+is+square?|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://github.com/Adriandmen/05AB1E/wiki/Codepage|2|https://tio.run/##yy9OTMpM/f//8MQ8/8Othzb9/29iBAA^0|0|6|0|9|3|1|0|0|0|6|2|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|@$A|19|B|1A|1|1B]]|C|$]]|$1|L|3|M|5|6|7|1C|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1D|8|@]|9|@]|C|$G|H]]]|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://github.com/Adriandmen/05AB1E" rel="noreferrer">05AB1E</a>, 5 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="noreferrer">bytes</a></h1>
<pre><code>ÑnOÅ²
</code></pre>
<p><strong><a href="https://tio.run/##yy9OTMpM/f//8MQ8/8Othzb9/29iBAA" rel="noreferrer" title="05AB1E – Try It Online">Try it online!</a></strong></p>
<h3>How?</h3>
<pre><code>ÑnOÅ²
Ñ     - divisors
 n    - square
  O   - sum
   Å² - is square?
</code></pre>


blocks|key|1952973|text|Python+2，55字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1952974|lambda+n:sum(i*i*(n%25i<1)for+i+in+range(1,n%2B1))**.5%251==0|code-block|syntax|javascript|1952975|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/2/|1|https://tio.run/##FckxDsIwDAXQGU7hpVKSWqiOSoeKnAQYgiBgif5WoQyc3qhvfctvfc2IVtLF3nm63TNh/Hwnp0GDQ6Mn8WWupKSgmvF8OGG04n0Ih2MjKXW2PbY/95GFYz@wdCzDddzvlqpYqTh4sz8^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>, 55 bytes</h1>



<pre class="lang-python prettyprint-override"><code>lambda n:sum(i*i*(n%i&lt;1)for i in range(1,n+1))**.5%1==0
</code></pre>

<p><a href="https://tio.run/##FckxDsIwDAXQGU7hpVKSWqiOSoeKnAQYgiBgif5WoQyc3qhvfctvfc2IVtLF3nm63TNh/Hwnp0GDQ6Mn8WWupKSgmvF8OGG04n0Ih2MjKXW2PbY/95GFYz@wdCzDddzvlqpYqTh4sz8" rel="nofollow noreferrer" title="Python 2 – Try It Online">Try it online!</a></p>


blocks|key|1951355|text|内姆，5字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1951356|ᛦq|code-block|syntax|javascript|1951357|解释：|unstyled|1951358|++++++Factors
+ᛦ++++++Squared
+++++++Summed
+++++++is+in?
+++q++++infinite+list+of+square+numbers|1951359|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/okx-code/Neim|1|https://tio.run/##y0vNzP3//8PcCa0PZy8DUmsKP8ydOuv/f0MzAA^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>, 5 bytes</h1>

<pre><code>ᛦq
</code></pre>

<p>Explanation:</p>

<pre><code>      Factors
 ᛦ      Squared
       Summed
       is in?
   q    infinite list of square numbers
</code></pre>

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


blocks|key|1954438|text|马蒂尔，9字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1954439|Z\UsX%5Etk=|code-block|syntax|javascript|1954440|在网上试试！|unstyled|1954441|只要它变得简单|1954442|Z\+%25+Divisors+of+(implicit)+input
U++%25+Square
s++%25+Sum
X%5E+%25+Square+root
t++%25+Duplicate+this+value
k=+%25+Is+it+equal+to+its+rounded+value?|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/lmendo/MATL|1|https://tio.run/##y00syfmf8D8qJrQ4Iq4k2/a/S1RFSOx/EyMuQy4jEzMuQwMuQzMA^0|0|3|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

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

<pre><code>Z\UsX^tk=
</code></pre>

<p><a href="https://tio.run/##y00syfmf8D8qJrQ4Iq4k2/a/S1RFSOx/EyMuQy4jEzMuQwMuQzMA" rel="nofollow noreferrer" title="MATL – Try It Online">Try it online!</a></p>

<p>As simple as it gets</p>

<pre><code>Z\ % Divisors of (implicit) input
U  % Square
s  % Sum
X^ % Square root
t  % Duplicate this value
k= % Is it equal to its rounded value?
</code></pre>


blocks|key|1952198|text|Dyalog+Unicode，18字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1952199|0=1%7C.5*⍨2%2B.*⍨∘∪⍳∨⊢|code-block|syntax|javascript|1952200|在网上试试！|unstyled|1952201|匿名兰博达。返回1表示真实，0表示虚假(+TIO中的测试用例被美化)。|1952202|向@H.PWiz大喊4字节！|1952203|How:|1952204|0=1%7C.5*⍨2%2B.*⍨∘∪⍳∨⊢+++⍝+Main+function,+argument+⍵+→+42
++++++++++++++++∨⊢+++⍝+Greatest+common+divisor+(∨)+between+⍵+(⊢)
+++++++++++++++⍳++++++⍝+and+the+range+(⍳)+[1..⍵]
++++++++++++++∪++++++⍝+Get+the+unique+items+(all+the+divisors+of+42;+1+2+3+6+7+14+21+42)
+++++++++++++∘++++++++⍝+Then
++++++++++++⍨+++++++++⍝+Swap+arguments+of
++++++++2%2B.*++++++++++⍝+dot+product+(.)+of+sum+(%2B)+and+power+(*)+between+the+list+and+2+
++++++++++++++++++++++⍝+(sums+the+result+of+each+element+in+the+vector+squared)
+++++++⍨++++++++++++++⍝+Use+the+result+vector+as+base
++++.5*+++++++++++++++⍝+Take+the+square+root
++1%7C++++++++++++++++++⍝+Modulo+1
0=++++++++++++++++++++⍝+Equals+0|entityMap|0|LINK|mutability|MUTABLE|url|https://www.dyalog.com/|1|https://tio.run/##SyzI0U2pTMzJT///38DWsEbPVOtR7wojbT0Q9ahjxqOOVY96Nz/qWPGoa9H/tEdtEx719j3qm@rp/6ir@dB640dtE4G84CBnIBni4Rn8/1HvqupHvVttDa3UQ4pKU9UfdbeouyXmFKeq1x5akXZohYmRgqGCkYmZgqGBgqEZAA^0|0|E|0|0|0|0|6|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]|$1|L|3|M|5|K|7|1B|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|1C|8|@]|9|@]|C|$]]|$1|P|3|Q|5|6|7|1D|8|@]|9|@]|C|$]]|$1|R|3|S|5|F|7|1E|8|@]|9|@]|C|$G|H]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]]]

<h1><a href="https://www.dyalog.com/" rel="nofollow noreferrer">APL (Dyalog Unicode)</a>, 18 bytes</h1>

<pre class="lang-apl prettyprint-override"><code>0=1|.5*⍨2+.*⍨∘∪⍳∨⊢
</code></pre>
<p><a href="https://tio.run/##SyzI0U2pTMzJT///38DWsEbPVOtR7wojbT0Q9ahjxqOOVY96Nz/qWPGoa9H/tEdtEx719j3qm@rp/6ir@dB640dtE4G84CBnIBni4Rn8/1HvqupHvVttDa3UQ4pKU9UfdbeouyXmFKeq1x5akXZohYmRgqGCkYmZgqGBgqEZAA" rel="nofollow noreferrer" title="APL (Dyalog Unicode) – Try It Online">Try it online!</a></p>
<p>Anonymous lambda. Returns 1 for truthy and 0 for falsy (test cases in TIO are prettified).</p>
<p>Shoutouts to @H.PWiz for 4 bytes!</p>
<h3>How:</h3>
<pre class="lang-apl prettyprint-override"><code>0=1|.5*⍨2+.*⍨∘∪⍳∨⊢   ⍝ Main function, argument ⍵ → 42
                ∨⊢   ⍝ Greatest common divisor (∨) between ⍵ (⊢)
               ⍳      ⍝ and the range (⍳) [1..⍵]
              ∪      ⍝ Get the unique items (all the divisors of 42; 1 2 3 6 7 14 21 42)
             ∘        ⍝ Then
            ⍨         ⍝ Swap arguments of
        2+.*          ⍝ dot product (.) of sum (+) and power (*) between the list and 2 
                      ⍝ (sums the result of each element in the vector squared)
       ⍨              ⍝ Use the result vector as base
    .5*               ⍝ Take the square root
  1|                  ⍝ Modulo 1
0=                    ⍝ Equals 0
</code></pre>


blocks|key|1953376|text|Pyt，7字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1953377|ð²ƩĐř²∈|code-block|syntax|javascript|1953378|在网上试试！|unstyled|1953379|解释|1953380|++++++++++++Implicit+input
ð+++++++++++Get+list+of+divisors
+²++++++++++Square+each+element
++Ʃ+++++++++Sum+the+list+[n]
+++Đ++++++++Duplicate+the+top+of+the+stack
++++ř²++++++Push+the+first+n+square+numbers
++++++∈+++++Is+n+in+the+list+of+square+numbers?
++++++++++++Implicit+output|1953381|ð²Ʃ√ĐƖ=|1953382|1953383|1953384|++++++++++++Implicit+input
ð+++++++++++Get+list+of+divisors
+²++++++++++Square+each+element
++Ʃ+++++++++Sum+the+list+[n]
+++√++++++++Take+the+square+root+of+n
++++Đ+++++++Duplicate+the+top+of+the+stack
+++++Ɩ++++++Cast+to+an+integer
++++++=+++++Are+the+top+two+elements+on+the+stack+equal+to+each+other?
++++++++++++Implicit+output|1953385|ð²Ʃ√1%25¬|1953386|1953387|1953388|++++++++++++Implicit+input
ð+++++++++++Get+list+of+divisors
+²++++++++++Square+each+element
++Ʃ+++++++++Sum+the+list+[n]
+++√++++++++Take+the+square+root+of+n
++++1%25++++++Take+the+square+root+of+n+modulo+1
++++++¬+++++Negate+[python+typecasting+ftw+:)]
++++++++++++Implicit+output|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/mudkip201/pyt|1|https://tio.run/##ARgA5/9weXT//8OwwrLGqcSQxZnCsuKIiP//NDI|2|https://tio.run/##ARcA6P9weXT//8OwwrLGqeKImsSQxpY9//80MQ|3|https://tio.run/##K6gs@f//8IZDm46tfNQxy1D10Jr//02MAA^0|0|3|0|0|0|0|6|1|0|0|0|0|0|6|2|0|0|0|0|0|6|3|0|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|6|7|1N|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1O|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|F|7|1P|8|@]|9|@]|C|$G|H]]|$1|R|3|J|5|K|7|1Q|8|@]|9|@$A|1R|B|1S|1|1T]]|C|$]]|$1|S|3|M|5|6|7|1U|8|@]|9|@]|C|$]]|$1|T|3|U|5|F|7|1V|8|@]|9|@]|C|$G|H]]|$1|V|3|W|5|F|7|1W|8|@]|9|@]|C|$G|H]]|$1|X|3|J|5|K|7|1X|8|@]|9|@$A|1Y|B|1Z|1|20]]|C|$]]|$1|Y|3|M|5|6|7|21|8|@]|9|@]|C|$]]|$1|Z|3|10|5|F|7|22|8|@]|9|@]|C|$G|H]]]|11|$12|$5|13|14|15|C|$16|17]]|18|$5|13|14|15|C|$16|19]]|1A|$5|13|14|15|C|$16|1B]]|1C|$5|13|14|15|C|$16|1D]]]]

<h1><a href="https://github.com/mudkip201/pyt" rel="nofollow noreferrer">Pyt</a>, 7 bytes</h1>
<pre><code>ð²ƩĐř²∈
</code></pre>
<p><a href="https://tio.run/##ARgA5/9weXT//8OwwrLGqcSQxZnCsuKIiP//NDI" rel="nofollow noreferrer" title="Pyt – Try It Online">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>            Implicit input
ð           Get list of divisors
 ²          Square each element
  Ʃ         Sum the list [n]
   Đ        Duplicate the top of the stack
    ř²      Push the first n square numbers
      ∈     Is n in the list of square numbers?
            Implicit output
</code></pre>
<hr />
<pre><code>ð²Ʃ√ĐƖ=
</code></pre>
<p><a href="https://tio.run/##ARcA6P9weXT//8OwwrLGqeKImsSQxpY9//80MQ" rel="nofollow noreferrer" title="Pyt – Try It Online">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>            Implicit input
ð           Get list of divisors
 ²          Square each element
  Ʃ         Sum the list [n]
   √        Take the square root of n
    Đ       Duplicate the top of the stack
     Ɩ      Cast to an integer
      =     Are the top two elements on the stack equal to each other?
            Implicit output
</code></pre>
<hr />
<pre><code>ð²Ʃ√1%¬
</code></pre>
<p><a href="https://tio.run/##K6gs@f//8IZDm46tfNQxy1D10Jr//02MAA" rel="nofollow noreferrer" title="Pyt – Try It Online">Try it online!</a></p>
<h3>Explanation</h3>
<pre><code>            Implicit input
ð           Get list of divisors
 ²          Square each element
  Ʃ         Sum the list [n]
   √        Take the square root of n
    1%      Take the square root of n modulo 1
      ¬     Negate [python typecasting ftw :)]
            Implicit output
</code></pre>


blocks|key|1952655|text|帕里/GP，23字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1952656|n->issquare(sigma(n,2))|code-block|syntax|javascript|1952657|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://pari.math.u-bordeaux.fr/|1|https://tio.run/##FYdBCoAgEAC/snjaBYUS8ZYfiQ4eUoRaNq1Drzc7DDMjsRaTpSdYoLMJpbXriXXHVvIZkbUl6lHkeJHBBJBa@B6p/lGQkIk0rM5qmDVY54engd@ofw^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>, 23 bytes</h1>

<pre><code>n-&gt;issquare(sigma(n,2))
</code></pre>

<p><a href="https://tio.run/##FYdBCoAgEAC/snjaBYUS8ZYfiQ4eUoRaNq1Drzc7DDMjsRaTpSdYoLMJpbXriXXHVvIZkbUl6lHkeJHBBJBa@B6p/lGQkIk0rM5qmDVY54engd@ofw" rel="nofollow noreferrer" title="Pari/GP – Try It Online">Try it online!</a></p>


blocks|key|1952717|text|果冻，6+字节数|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1952718|ÆD²SÆ²|code-block|syntax|javascript|1952719|在网上试试！或者看测试套件。|unstyled|1952720|怎么做？|1952721|ÆD²SÆ²+-+Main+Link:+integer
ÆD+++++-+divisors
++²++++-+square
+++S+++-+sum
++++Æ²+-+is+square?|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://github.com/DennisMitchell/jelly/wiki/Code-page|2|https://tio.run/##y0rNyan8//9wm8uhTcGH2w5t@v//v4kRAA|3|https://tio.run/##y0rNyan8//9wm8uhTcGH2w5t@n90z@H2R01r3P//NzHSUTDUUTAyMQPSBkBsBgA^0|0|2|0|5|3|1|0|0|0|6|2|9|4|3|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|@$A|1B|B|1C|1|1D]|$A|1E|B|1F|1|1G]]|C|$]]|$1|L|3|M|5|6|7|1H|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|1I|8|@]|9|@]|C|$G|H]]]|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]]|10|$5|R|S|T|C|$U|11]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a>, 6 <a href="https://github.com/DennisMitchell/jelly/wiki/Code-page" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>ÆD²SÆ²
</code></pre>
<p><strong><a href="https://tio.run/##y0rNyan8//9wm8uhTcGH2w5t@v//v4kRAA" rel="nofollow noreferrer" title="Jelly – Try It Online">Try it online!</a></strong> Or see the <a href="https://tio.run/##y0rNyan8//9wm8uhTcGH2w5t@n90z@H2R01r3P//NzHSUTDUUTAyMQPSBkBsBgA" rel="nofollow noreferrer" title="Jelly – Try It Online">test-suite</a>.</p>
<h3>How?</h3>
<pre><code>ÆD²SÆ² - Main Link: integer
ÆD     - divisors
  ²    - square
   S   - sum
    Æ² - is square?
</code></pre>


blocks|key|1951873|text|外壳，6字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1951874|£İ□ṁ□Ḋ|code-block|syntax|javascript|1951875|在网上试试！|unstyled|1951876|解释|1951877|£İ□ṁ□Ḋ++--+example+input+12
+++++Ḋ++--+divisors:+[1,2,3,4,6,12]
+++ṁ++++--+map+the+following+..
++++□+++--+%7C+square:+[1,4,9,16,36,144]
++++++++--+..+and+sum:+210
£+++++++--+is+it+element+of+(assumes+sorted)
+İ□+++++--+%7C+list+of+squares:+[1,4,9,16..196,225,..|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/barbuz/Husk|1|https://tio.run/##yygtzv6fG5yvnaCtpKBrp6B0Yn3xo6bGokPb/h9afGTDo2kLH@5sBJE7uv7//29ixGXIZWRixmVowGVoBgA^0|0|2|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

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

<pre><code>£İ□ṁ□Ḋ
</code></pre>

<p><a href="https://tio.run/##yygtzv6fG5yvnaCtpKBrp6B0Yn3xo6bGokPb/h9afGTDo2kLH@5sBJE7uv7//29ixGXIZWRixmVowGVoBgA" rel="nofollow noreferrer" title="Husk – Try It Online">Try it online!</a></p>

<h3>Explanation</h3>

<pre><code>£İ□ṁ□Ḋ  -- example input 12
     Ḋ  -- divisors: [1,2,3,4,6,12]
   ṁ    -- map the following ..
    □   -- | square: [1,4,9,16,36,144]
        -- .. and sum: 210
£       -- is it element of (assumes sorted)
 İ□     -- | list of squares: [1,4,9,16..196,225,..
</code></pre>


blocks|key|1953103|text|质子，41字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1953104|a=>sum(q*q+for+q:1..a%2B1if+a%25q<1)**.5%251==0|code-block|syntax|javascript|1953105|在网上试试！|unstyled|1953106|类似于Python答案的方法。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/alexander-liao/proton|1|https://tio.run/##KyjKL8nP@59m@z/R1q64NFejUKtQIS2/SKHQylBPL1HbMDNNIVG10MZQU0tLz1TV0NbW4H9BUWZeiUaahomRpiYXjGOIxDYyMUOWMUDmAGX@AwA^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|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/alexander-liao/proton" rel="nofollow noreferrer">Proton</a>, 41 bytes</h1>

<pre><code>a=&gt;sum(q*q for q:1..a+1if a%q&lt;1)**.5%1==0
</code></pre>

<p><a href="https://tio.run/##KyjKL8nP@59m@z/R1q64NFejUKtQIS2/SKHQylBPL1HbMDNNIVG10MZQU0tLz1TV0NbW4H9BUWZeiUaahomRpiYXjGOIxDYyMUOWMUDmAGX@AwA" rel="nofollow noreferrer" title="Proton – Try It Online">Try it online!</a></p>

<p>Similar approach to the Python answer.</p>


blocks|key|1953253|text|Mathematica，32字节|type|header-one|depth|inlineStyleRanges|entityRanges|data|1953254|IntegerQ@Sqrt[2~DivisorSigma~#]&|code-block|syntax|javascript|1953255|纯函数接受一个数字作为输入，并返回True或False作为输出。不完全确定是否有一种较短的检查完美平方的方法。|unstyled|offset|length|style|CODE|entityMap^0|0|0|H|4|M|5^^$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]]|9|@]|A|$]]]|N|$]]

<h1>Mathematica, 32 bytes</h1>

<pre><code>IntegerQ@Sqrt[2~DivisorSigma~#]&amp;
</code></pre>

<p>Pure function. Takes a number as input and returns <code>True</code> or <code>False</code> as output. Not entirely sure if there's a shorter method for checking perfect squares.</p>


blocks|key|1953471|text|八度+/+MATLAB，43字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1953472|@(n)~mod(sqrt(sum(find(~mod(n,1:n)).%5E2)),1)|code-block|syntax|javascript|1953473|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.gnu.org/software/octave/|1|https://tio.run/##y08uSSxL/Z9mq6en999BI0@zLjc/RaO4sKhEo7g0VyMtMy9FAyyUp2NolaepqRdnpKmpY6j5P03DxEiTK03DEEQYmZiB2QZg0kzzPwA^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://www.gnu.org/software/octave/" rel="nofollow noreferrer">Octave</a> / MATLAB, 43 bytes</h1>



<pre class="lang-matlab prettyprint-override"><code>@(n)~mod(sqrt(sum(find(~mod(n,1:n)).^2)),1)
</code></pre>

<p><a href="https://tio.run/##y08uSSxL/Z9mq6en999BI0@zLjc/RaO4sKhEo7g0VyMtMy9FAyyUp2NolaepqRdnpKmpY6j5P03DxEiTK03DEEQYmZiB2QZg0kzzPwA" rel="nofollow noreferrer" title="Octave – Try It Online">Try it online!</a></p>


blocks|key|1953587|text|Perl+6，34字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1953588|-1字节，多亏了nwellnhof|unstyled|1953589|{grep($_%25%25*,1..$_)>>².sum**.5%25%251}|code-block|syntax|javascript|1953590|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/nxadm/rakudo-pkg|1|https://tio.run/##K0gtyjH7n1upoJamYPu/Or0otUBDJV5VVUvHUE9PJV7Tzu7QJr3i0lwtLT1TVVXD2v9p@UUKNoYKJkYKRiZmCoYGCoZmdgrVXAoKxYmVCkoq8Qq2dgpKdWlAQzS5av8DAA^0|0|6|0|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|11|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://github.com/nxadm/rakudo-pkg" rel="nofollow noreferrer">Perl 6</a>, 34 bytes</h1>

<p><em>-1 byte thanks to nwellnhof</em></p>



<pre class="lang-perl6 prettyprint-override"><code>{grep($_%%*,1..$_)&gt;&gt;².sum**.5%%1}
</code></pre>

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


blocks|key|1952735|text|红色，67字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1952736|func[n][s:+0+repeat+d+n[if+n+%25+d+=+0[s:+d+*+d+%2B+s]](sqrt+s)%25+1+=+0]|code-block|syntax|javascript|1952737|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|http://www.red-lang.org/|1|https://tio.run/##Rcm9CoAgGIXhvas4S9DPohINQTfRKt8QqeDyUWrXbzpUw4GH8wZr8maNpsYt2d18aCYdFwgEe9o9wYC1d2C0hStEjQZD2YhI1MUrJMS@hayV8hk8JzhMqnkpP6lp/l/xc84P^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>, 67 bytes</h1>

<pre><code>func[n][s: 0 repeat d n[if n % d = 0[s: d * d + s]](sqrt s)% 1 = 0]
</code></pre>

<p><a href="https://tio.run/##Rcm9CoAgGIXhvas4S9DPohINQTfRKt8QqeDyUWrXbzpUw4GH8wZr8maNpsYt2d18aCYdFwgEe9o9wYC1d2C0hStEjQZD2YhI1MUrJMS@hayV8hk8JzhMqnkpP6lp/l/xc84P" rel="nofollow noreferrer" title="Red – Try It Online">Try it online!</a></p>


blocks|key|1953920|text|F#，111个字节|type|header-one|depth|inlineStyleRanges|entityRanges|data|1953921|let+d+n=Seq.where(fun+v->n%25v=0){1..n}
let+u+n=
+let+m=d+n%7C>Seq.sumBy(fun+x->x*x)
+d+m%7C>Seq.exists(fun+x->x*x=m)|code-block|syntax|javascript|1953922|在网上试试！|unstyled|offset|length|1953923|所以d得到了1和n包含的所有数字的除数。在主函数u中，第一行将所有平方除数的和分配给m。第二行获取m的除数，并确定其中任何平方是否等于m。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##TY7LCsIwEEX3/YqhULBCS5XSjSYLwb3QpbqommrApJpHjajfXicpiAMhgXPvmbQ6O3aKDcOVGTiBJDW7548LU2zSWgl9RmXSkyJ9zfJcfiKfspiKwL8Ewcab@oq2YvUMFZdRN3VphDYxMua4NvoPEpEO2@VaGvXcdFwaug9i0XAJjTr3gH6cbTlfwGwB87LCu8BT7QN4U/BebpiCUQsZDcSPV3FdW1HfbaMYEPyx@9GbwoWthDjhO5McYuz@hdOQK4Yv^0|0|0|0|6|0|0|2|1|8|1|O|1|16|1|1D|1|1V|1^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Y|8|@]|9|@$J|Z|K|10|1|11]]|A|$]]|$1|L|3|M|5|I|7|12|8|@$J|13|K|14|N|O]|$J|15|K|16|N|O]|$J|17|K|18|N|O]|$J|19|K|1A|N|O]|$J|1B|K|1C|N|O]|$J|1D|K|1E|N|O]]|9|@]|A|$]]]|P|$Q|$5|R|S|T|A|$U|V]]]]

<h2>F#, 111 bytes</h2>
<pre><code>let d n=Seq.where(fun v-&gt;n%v=0){1..n}
let u n=
 let m=d n|&gt;Seq.sumBy(fun x-&gt;x*x)
 d m|&gt;Seq.exists(fun x-&gt;x*x=m)
</code></pre>
<p><a href="https://tio.run/##TY7LCsIwEEX3/YqhULBCS5XSjSYLwb3QpbqommrApJpHjajfXicpiAMhgXPvmbQ6O3aKDcOVGTiBJDW7548LU2zSWgl9RmXSkyJ9zfJcfiKfspiKwL8Ewcab@oq2YvUMFZdRN3VphDYxMua4NvoPEpEO2@VaGvXcdFwaug9i0XAJjTr3gH6cbTlfwGwB87LCu8BT7QN4U/BebpiCUQsZDcSPV3FdW1HfbaMYEPyx@9GbwoWthDjhO5McYuz@hdOQK4Yv" rel="nofollow noreferrer">Try it online!</a></p>
<p>So <code>d</code> gets the divisors for all numbers between 1 and <code>n</code> inclusive. In the main function <code>u</code>, the first line assigns the sum of all squared divisors to <code>m</code>. The second line gets the divisors for <code>m</code> and determines if any of them squared equals <code>m</code>.</p>


blocks|key|1954059|text|Perl+5，47字节|type|header-one|depth|inlineStyleRanges|entityRanges|data|1954060|$a%2B=$_*$_*!($n%25$_)for+1..$n;$a=!($a**.5=~/\D/);+|code-block|syntax|javascript|1954061|返回1表示为true，而对false不返回任何内容。|unstyled|1954062|解释：|1954063|$a%2B=++++++++++++++for+1..$n;++++++++++++++++++++++sum+over+i=1+to+n
++++$_*$_+++++++++++++++++++++++++++++++++++++++++square+each+component+of+the+sum
+++++++++*!($n%25$_)++++++++++++++++++++++++++++++++multiply+by+1+if+i+divides+n.
++++++++++++++++++++++++++++$a=+++++++++++++++++++a+equals
++++++++++++++++++++++++++++++++($a**.5+++++++++++whether+the+square+root+of+a
+++++++++++++++++++++++++++++++!+++++++=~/\D/);+++does+not+contain+a+non-digit.|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|Q|8|@]|9|@]|A|$]]|$1|J|3|K|5|6|7|R|8|@]|9|@]|A|$]]|$1|L|3|M|5|D|7|S|8|@]|9|@]|A|$E|F]]]|N|$]]

<h1>Perl 5, 47 bytes</h1>

<pre><code>$a+=$_*$_*!($n%$_)for 1..$n;$a=!($a**.5=~/\D/); 
</code></pre>

<p>Returns 1 for true and nothing for false.</p>

<h3>Explanation:</h3>

<pre><code>$a+=              for 1..$n;                      sum over i=1 to n
    $_*$_                                         square each component of the sum
         *!($n%$_)                                multiply by 1 if i divides n.
                            $a=                   a equals
                                ($a**.5           whether the square root of a
                               !       =~/\D/);   does not contain a non-digit.
</code></pre>


blocks|key|1953057|text|Groovy，47字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1953058|接受数值参数的朗姆达。|unstyled|1953059|n->s=(1..n).sum{i->n%25i?0:i*i}
!(s%25Math.sqrt(s))|code-block|syntax|javascript|1953060|解释|style|BOLD|1953061|(1..n)创建一个值1到n的数组。|CODE|1953062|如果n%25i除以没有余数的n，则i为false+(如同0是假的)|1953063|如果n%25i+?+0+:+i*i除以没有余数的n，则为i值的平方之和，否则为0。|1953064|sum{+i->+n%25i+?+0+:+i*i+}对数组中所有i的前一个结果进行求和。|1953065|如果s%25Math.sqrt(s)的sqrt除以没有余数的s，则s为false+(与0相同)|1953066|!(s%25Math.sqrt(s))从lambda+(在最后一条语句中隐式的return)返回!false，当s的sqrt除以没有余数的s时|1953067|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|http://groovy-lang.org/|1|https://tio.run/##Sy/Kzy@r/J@SmqaQk5iblJKoYKtQ/T9P167YVsNQTy9PU6@4NLc6U9cuTzXT3sAqUyuzlktRo1jVN7EkQ6@4sKhEo1hT838tV0FRZl5JTh7UEA0TI010IUMMESMTM0xVBphCQFVFqSWlRXn/AQ^0|0|6|0|0|0|0|0|2|0|0|6|0|2|3|C|1|F|1|0|2|D|M|1|Q|1|0|0|O|U|1|0|2|E|S|1|V|1|0|0|H|11|6|1A|6|1I|1|1V|1|0|0|6|1^^$0|@$1|2|3|4|5|6|7|1D|8|@]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|D|3|E|5|F|7|1H|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|1I|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|1J|8|@$A|1K|B|1L|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1M|8|@$A|1N|B|1O|N|R]]|9|@]|C|$]]|$1|S|3|T|5|F|7|1P|8|@$A|1Q|B|1R|N|R]|$A|1S|B|1T|N|R]|$A|1U|B|1V|N|R]]|9|@]|C|$]]|$1|U|3|V|5|F|7|1W|8|@$A|1X|B|1Y|N|R]|$A|1Z|B|20|N|R]|$A|21|B|22|N|R]]|9|@]|C|$]]|$1|W|3|X|5|F|7|23|8|@$A|24|B|25|N|R]|$A|26|B|27|N|R]]|9|@]|C|$]]|$1|Y|3|Z|5|F|7|28|8|@$A|29|B|2A|N|R]|$A|2B|B|2C|N|R]|$A|2D|B|2E|N|R]]|9|@]|C|$]]|$1|10|3|11|5|F|7|2F|8|@$A|2G|B|2H|N|R]|$A|2I|B|2J|N|R]|$A|2K|B|2L|N|R]|$A|2M|B|2N|N|R]|$A|2O|B|2P|N|R]]|9|@]|C|$]]|$1|12|3|13|5|F|7|2Q|8|@]|9|@$A|2R|B|2S|1|2T]]|C|$]]]|14|$15|$5|16|17|18|C|$19|1A]]|1B|$5|16|17|18|C|$19|1C]]]]

<h1><a href="http://groovy-lang.org/" rel="nofollow noreferrer">Groovy</a>, 47 bytes</h1>

<p>A lambda accepting a numeric argument.</p>

<pre><code>n-&gt;s=(1..n).sum{i-&gt;n%i?0:i*i}
!(s%Math.sqrt(s))
</code></pre>

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

<p><code>(1..n)</code> creates an array of the values 1 to n</p>

<p><code>n%i</code> is false (as 0 is falsy) if <code>i</code> divides <code>n</code> without remainder</p>

<p><code>n%i ? 0 : i*i</code> is the sum of the square of the value <code>i</code> if it divides <code>n</code> without remainder, otherwise is 0</p>

<p><code>sum{ i-&gt; n%i ? 0 : i*i }</code> sums the previous result across all <code>i</code> in the array.</p>

<p><code>s%Math.sqrt(s)</code> is false (as 0 is falsy) if the sqrt of <code>s</code> divides <code>s</code> without remainder</p>

<p><code>!(s%Math.sqrt(s))</code> returns from the lambda (<code>return</code> implicit on last statement) <code>!false</code> when the sqrt of <code>s</code> divides <code>s</code> without remainder</p>

<p><a href="https://tio.run/##Sy/Kzy@r/J@SmqaQk5iblJKoYKtQ/T9P167YVsNQTy9PU6@4NLc6U9cuTzXT3sAqUyuzlktRo1jVN7EkQ6@4sKhEo1hT838tV0FRZl5JTh7UEA0TI010IUMMESMTM0xVBphCQFVFqSWlRXn/AQ" rel="nofollow noreferrer" title="Groovy – Try It Online">Try it online!</a></p>


blocks|key|1953266|text|欧姆v2，5字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1953267|V²ΣÆ²|code-block|syntax|javascript|1953268|在网上试试！解释：|unstyled|1953269|V²ΣÆ²++++
V++++++Pushes+input's+divisors
+²+++++Squares
+++Σ+++Sum
++++Æ²+Returns+whether+value+is+a+proper+square.|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/nickbclifford/Ohm|1|https://tio.run/##y8/INfr/P@zQpnOLD7cd2vT/v4kRAA^0|0|4|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/nickbclifford/Ohm" rel="nofollow noreferrer">Ohm v2</a>, 5 bytes</h1>

<pre><code>V²ΣÆ²
</code></pre>

<p><a href="https://tio.run/##y8/INfr/P@zQpnOLD7cd2vT/v4kRAA" rel="nofollow noreferrer" title="Ohm v2 – Try It Online">Try it online!</a>
Explanation:</p>

<pre><code>V²ΣÆ²    
V      Pushes input's divisors
 ²     Squares
   Σ   Sum
    Æ² Returns whether value is a proper square.
</code></pre>


blocks|key|1954355|text|APL，23个字符，46个字节|type|header-one|depth|inlineStyleRanges|entityRanges|data|1954356|{0=1∣√%2B/×⍨(0=a∣⍵)/a←⍳⍵}|code-block|syntax|javascript|1954357|测试：|unstyled|1954358|+++g←{0=1∣√%2B/×⍨(0=a∣⍵)/a←⍳⍵}+++++
+++g¨+42+1+246+10+16
1+1+1+0+0+|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|O|8|@]|9|@]|A|$]]|$1|J|3|K|5|D|7|P|8|@]|9|@]|A|$E|F]]]|L|$]]

<h1>APL(NARS), 23 chars, 46 bytes</h1>
<pre><code>{0=1∣√+/×⍨(0=a∣⍵)/a←⍳⍵}
</code></pre>
<p>test:</p>
<pre><code>   g←{0=1∣√+/×⍨(0=a∣⍵)/a←⍳⍵}     
   g¨ 42 1 246 10 16
1 1 1 0 0 
</code></pre>


blocks|key|1951961|text|盖亚，5字节|type|header-one|depth|inlineStyleRanges|entityRanges|offset|length|data|1951962|ds¦Σụ|code-block|syntax|javascript|1951963|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/splcurran/Gaia|1|https://tio.run/##AScA2P9nYWlh//9kc8KmzqPhu6X/ZeKGkcKm/1s0MiAxIDI0NiAxMCAxNl0^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/splcurran/Gaia" rel="nofollow noreferrer">Gaia</a>, 5 bytes</h1>

<pre><code>ds¦Σụ
</code></pre>

<p><a href="https://tio.run/##AScA2P9nYWlh//9kc8KmzqPhu6X/ZeKGkcKm/1s0MiAxIDI0NiAxMCAxNl0" rel="nofollow noreferrer" title="Gaia – Try It Online">Try it online!</a></p>


<p>Let \$n=42\$ (Input)</p>

<p>Then divisors are : 1, 2, 3, 6, 7, 14, 21, 42</p>

<p>Squaring each divisor : 1, 4, 9, 36, 49, 196, 441, 1764</p>

<p>Taking sum (adding) : 2500</p>

<p>Since \$50\times 50=2500\$ therefore we return a truthy value. If it is not a perfect square, return a falsy value.</p>

<h1>Examples :</h1>

<pre><code>42  ---&gt; true
1   ---&gt; true
246 ---&gt; true
10  ---&gt; false
16  ---&gt; false
</code></pre>

<p>This is <a href="/questions/tagged/code-golf" class="post-tag" title="show questions tagged &#39;code-golf&#39;" rel="tag">code-golf</a> so shortest code in bytes for each language wins </p>

<p>Thanks to @Arnauld for pointing out the sequence : <a href="https://oeis.org/A046655" rel="noreferrer">A046655</a></p>


Sum \$\text{Square}^2\$

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

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

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

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

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

社区新版编辑器体验调研

让\$n=42\$ (输入)然后除数是: 1，2，3，6，7，14，21，42除数: 1，4，9，36，49,196,441,1764取和(加)：2500因为$50\乘以50=2500\$，所以我们返回一个真实值。如果它不是一个完美的平方，返回一个虚假的价值。示例:42  ---> true1   ---> true246 ---> true10  ---> false16  ---> false

问Sum \$\text{Square}^2\$
EN

示例:

回答 20

Code Golf用户

05AB1E，5 字节数

怎么做？

Code Golf用户

Python 2，55字节

Code Golf用户

内姆，5字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Sum \$\text{Square}^2\$EN

示例:

回答 20

Code Golf用户

05AB1E，5 字节数

怎么做？

Code Golf用户

Python 2，55字节

Code Golf用户

内姆，5字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Sum \$\text{Square}^2\$
EN