Distinct palindromes within decimal numbers: Difference between revisions

=={{header|Factor}}==

{{works with|Factor|0.99 2021-02-05}}

sequences sequences.extras sets ;

 

1320267947849490361205695 }

[ dup dpal [ length 2 < ] reject empty? "%-25d %u\n" printf ]

{{out}}

<pre>

=={{header|Go}}==

{{trans|Wren}}

 

import (

fmt.Printf("%-25s %t\n", num, none)

}

 

{{out}}

Note that for the second task, and for very large integers (greater than 2^53) in general, accurate results require

gojq, or a version of jq supporting "big integer" literals.

# input: an integer

# output a stream of distinct integers, each representing an admissible palindrome

task1,

"\nThe integers amongst those in the problem statement that have 2 or more digits:",

{{out}}

<pre>

 

=={{header|Julia}}==

pals = Vector{Vector{T}}([[x] for x in a])

len = length(a)

println(rpad(n, 26), palindrome2plusfree(n))

end

<pre>

Number Palindromes

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

ContainsPalindromeQ[n_Integer, minlength_ : 1, b_ : 10] := Select[DeleteDuplicates@Subsequences[IntegerDigits[n, b], {minlength, \[Infinity]}], PalindromeQ]

ContainsPalindromeQ /@ Range[100, 125] // Column

123498769, 12346098769, 1234572098769, 123456832098769,

12345679432098769, 1234567905432098769, 123456790165432098769,

{{out}}

<pre>{{1},{0},{0,0}}

 

=={{header|Nim}}==

 

iterator substrings(s: string): string =

let verb = if pals2.len == 0: " doesn't contain palindromes "

else: " contains at least one palindrome "

 

{{out}}

 

=={{header|Perl}}==

 

# https://rosettacode.org/wiki/Distinct_Palindromes_Within_Decimal_Numbers

123456832098769, 12345679432098769, 1234567905432098769,

123456790165432098769, 83071934127905179083, 1320267947849490361205695'

{{out}}

<pre>

 

=={{header|Phix}}==

<span style="color: #008080;">procedure</span> <span style="color: #000000;">show_all_palindromes</span><span style="color: #0000FF;">(</span><span style="color: #004080;">string</span> <span style="color: #000000;">s</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">integer</span> <span style="color: #000000;">longest</span><span style="color: #0000FF;">=</span><span style="color: #000000;">0</span><span style="color: #0000FF;">)</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">res</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{}</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"\nNumber Has no &gt;2 digit palindromes\n"</span><span style="color: #0000FF;">)</span>

<span style="color: #7060A8;">papply</span><span style="color: #0000FF;">(</span><span style="color: #004600;">true</span><span style="color: #0000FF;">,</span><span style="color: #000000;">show_all_palindromes</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">tests</span><span style="color: #0000FF;">,</span><span style="color: #000000;">1</span><span style="color: #0000FF;">})</span>

{{out}}

<pre>

=={{header|Raku}}==

A minor modification of the [[Longest_palindromic_substrings#Raku|Longest palindromic substrings]] task. As such, works for any string, not just integers.

 

sub getpal ($str) {

123456832098769, 12345679432098769, 1234567905432098769,

123456790165432098769, 83071934127905179083, 1320267947849490361205695,

{{out}}

<pre>All palindromic substrings including (bizarrely enough) single characters:

=={{header|REXX}}==

This REXX version can handle strings or numbers.

parse arg LO HI mL $$ /*obtain optional arguments from the CL*/

if LO='' | LO="," then LO= 100 /*Not specified? Then use the default.*/

end /*k*/

end /*j*/

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

 

=={{header|Sidef}}==

gather {

for a in (0..arr.end), b in (a .. arr.end) {

say ("#{'%25s' % n} has #{'%2d' % p.len} palindromes of length 2 or more: ",

p.sort.map{.join}.sort_by{.len}.join(' '))

{{out}}

<pre>

{{libheader|Wren-fmt}}

{{libheader|Wren-sort}}

import "/fmt" for Fmt

import "/sort" for Sort

var none = !ss.any { |s| s == s[-1..0] }

Fmt.print("$-25s $s", num, none)

 

{{out}}