Rare numbers: Difference between revisions
Content added Content deleted
Langurmonkey (talk | contribs) |
Langurmonkey (talk | contribs) |
||
| Line 3,896: | Line 3,896: | ||
It could look something like the following (ignoring whatever optimizations the other examples are using), if it was fast enough. I did not have the time/processor to test finding the first 5. The .israre() function appears to return the right answer, tested with individual numbers. |
It could look something like the following (ignoring whatever optimizations the other examples are using), if it was fast enough. I did not have the time/processor to test finding the first 5. The .israre() function appears to return the right answer, tested with individual numbers. |
||
<syntaxhighlight lang="langur">val .perfectsquare = |
<syntaxhighlight lang="langur">val .perfectsquare = fn(.n) (.n ^/ 2) div 1 |
||
val .israre = |
val .israre = fn(.n) { |
||
val .r = reverse(.n) |
val .r = reverse(.n) |
||
if .n == .r: return false |
if .n == .r: return false |
||
| Line 3,906: | Line 3,906: | ||
} |
} |
||
val .findfirst = |
val .findfirst = fn(.max) { |
||
for[=[]] .i = 0; len(_for) < .max; .i += 1 { |
for[=[]] .i = 0; len(_for) < .max; .i += 1 { |
||
if .israre(.i) { |
if .israre(.i) { |
||