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 14:27, 14 September 2017
, 6 years agono edit summary
No edit summary |
|||
Line 321:
5415589 101012010210101(3) 10100101010001010100101(2)
90396755477 22122022220102222022122(3) 1010100001100000100010000011000010101(2)</pre>
=={{header|Elixir}}==
Line 1,183 ⟶ 1,185:
exit /*stick a fork in it, we're all done. */</lang>
'''output''' is identical to the 1<sup>st</sup> REXX version. <br><br>
=={{header|Ring}}==
<lang ring>
# Project : Find palindromic numbert
# Date : 2017/09/14
# Author : Gal Zsolt (~ CalmoSoft ~)
# Email : <calmosoft@gmail.com>
decimals(0)
for n=1 to 7000
flag1 = 0
flag2 = 0
strbin = decimaltobase(n, 2)
if palindrome(strbin) = 1
flag1 = 1
ok
strter = decimaltobase(n, 3)
if palindrome(strter) = 1
flag2 = 1
ok
if flag1 = 1 and flag2 = 1
see "Decimal : " + n + nl
see "Binary : " + strbin + nl
see "Ternary : " + strter + nl + nl
ok
next
see "OK" + nl
func decimaltobase(nr, base)
binary = 0
i = 1
while(nr != 0)
remainder = nr % base
nr = floor(nr/base)
binary= binary + (remainder*i)
i = i*10
end
return string(binary)
Func palindrome aString
bString = ""
for i=len(aString) to 1 step -1
bString = bString + aString[i]
next
if aString = bString return 1 ok
return 0
</lang>
Output:
<pre>
Decimal : 1
Binary : 1
Ternary : 1
Decimal : 6643
Binary : 1100111110011
Ternary : 100010001
</pre>
=={{header|Ruby}}==
| |||