Anonymous user
Find palindromic numbers in both binary and ternary bases: Difference between revisions
Find palindromic numbers in both binary and ternary bases (view source)
Revision as of 09:14, 25 August 2017
, 6 years ago→Advanced Technique
Line 116:
</lang>
{{out}}
On a modern machine, (core i5 for example), this code, compiled with the -O3 and -gnatp options, takes less than 5 seconds to give the seven first palindromes smaller than 2^64.
<pre>
2#0# 3#0# 0
| |||