Find palindromic numbers in both binary and ternary bases: Difference between revisions

Content added Content deleted
(Rename Perl 6 -> Raku, alphabetize, minor clean-up)
(Added Wren)
Line 2,784: Line 2,784:
' 328601606 381920985378904469 59 10101001100110110110001110011011001110001101101100110010101 37 2112200222001222121212221002220022112
' 328601606 381920985378904469 59 10101001100110110110001110011011001110001101101100110010101 37 2112200222001222121212221002220022112
Completed in 5,14 secondsCompleted in 16394,64 seconds
Completed in 5,14 secondsCompleted in 16394,64 seconds
</pre>

=={{header|Wren}}==
{{trans|Go}}
{{libheader|Wren-fmt}}
Just the first 6 palindromes as the 7th is too large for Wren to process without resorting to BigInts.
<lang ecmascript>import "/fmt" for Fmt

var isPalindrome2 = Fn.new { |n|
var x = 0
if (n % 2 == 0) return n == 0
while (x < n) {
x = x*2 + (n%2)
n = (n/2).floor
}
return n == x || n == (x/2).floor
}

var reverse3 = Fn.new { |n|
var x = 0
while (n != 0) {
x = x*3 + (n%3)
n = (n/3).floor
}
return x
}

var start

var show = Fn.new { |n|
Fmt.print("Decimal : $d", n)
Fmt.print("Binary : $b", n)
Fmt.print("Ternary : $t", n)
Fmt.print("Time : $0.3f ms\n", (System.clock - start)*1000)
}

var min = Fn.new { |a, b| (a < b) ? a : b }
var max = Fn.new { |a, b| (a > b) ? a : b }

start = System.clock
System.print("The first 6 numbers which are palindromic in both binary and ternary are :\n")
show.call(0)
var cnt = 1
var lo = 0
var hi = 1
var pow2 = 1
var pow3 = 1
while (true) {
var i = lo
while (i < hi) {
var n = (i*3+1)*pow3 + reverse3.call(i)
if (isPalindrome2.call(n)) {
show.call(n)
cnt = cnt + 1
if (cnt >= 6) return
}
i = i + 1
}
if (i == pow3) {
pow3 = pow3 * 3
} else {
pow2 = pow2 * 4
}
while (true) {
while (pow2 <= pow3) pow2 = pow2 * 4
var lo2 = (((pow2/pow3).floor - 1)/3).floor
var hi2 = (((pow2*2/pow3).floor-1)/3).floor + 1
var lo3 = (pow3/3).floor
var hi3 = pow3
if (lo2 >= hi3) {
pow3 = pow3 * 3
} else if (lo3 >= hi2) {
pow2 = pow2 * 4
} else {
lo = max.call(lo2, lo3)
hi = min.call(hi2, hi3)
break
}
}
}</lang>

{{out}}
<pre>
The first 6 numbers which are palindromic in both binary and ternary are :

Decimal : 0
Binary : 0
Ternary : 0
Time : 0.054 ms

Decimal : 1
Binary : 1
Ternary : 1
Time : 0.147 ms

Decimal : 6643
Binary : 1100111110011
Ternary : 100010001
Time : 0.290 ms

Decimal : 1422773
Binary : 101011011010110110101
Ternary : 2200021200022
Time : 0.919 ms

Decimal : 5415589
Binary : 10100101010001010100101
Ternary : 101012010210101
Time : 1.408 ms

Decimal : 90396755477
Binary : 1010100001100000100010000011000010101
Ternary : 22122022220102222022122
Time : 184.314 ms
</pre>
</pre>


Retrieved from "https://rosettacode.org/wiki/Find_palindromic_numbers_in_both_binary_and_ternary_bases"